Managing coordinated improvement of control operations for multiple electrical devices to reduce power dissipation

ABSTRACT

Techniques are described for implementing automated control systems that repeatedly perform automated modifications to control system actuator components&#39; ongoing operations to improve functionality for electrical devices in target systems, such as to reduce power dissipation while using the electrical devices. The described techniques further include synchronizing a particular control system&#39;s state improvements with corresponding control system state improvements being performed for one or more other control systems that are each controlling one or more distinct electrical devices in the target system(s), so as to improve the collective control system functionality according to one or more criteria (e.g., to reduce power dissipation)—such synchronizing may include, for example, generating a mean field representation of the overall control system state for the target system(s) and using the mean field representation to improve the overall control system state.

TECHNICAL FIELD

The following disclosure relates generally to techniques for automated control systems to control usage of associated electrical devices in a coordinated manner to repeatedly and automatically modify the control systems' operations over time to improve their collective control functionality, such as to synchronize the control systems' operations over time to reduce power dissipation while performing other activities to use the associated electrical devices (e.g., to maximize battery life of a battery when supplying requested electrical power).

BACKGROUND

Attempts have been made to implement automated control systems for various types of physical systems having inputs or other control elements that the control system can manipulate in an attempt to provide desired output or other behavior of the physical systems one example of such automated control is to manage operations of a battery that is discharging electrical power to support a load and/or is charging using electrical power from a source, while uncertainty exists about an internal temperature and/or chemical state of the battery, and potentially with ongoing changes in load, source and/or internal state of the battery. Such automated control systems have used various types of architectures and underlying computing technologies to attempt to implement such functionality.

However, various difficulties exist with existing automated control systems for battery systems and other electrical devices, including with respect to managing uncertainty in a current state of a system being controlled and in how different types of inputs will affect operation of the automated control systems.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1A includes a diagram illustrating use of control state manager components to repeatedly and automatically modify control systems' usage of electrical devices of a target system to improve their functionality.

FIG. 1B is a network diagram illustrating an example environment in which a system for performing cooperative distributed control of target systems may be configured and initiated.

FIG. 1C is a network diagram illustrating an example environment in which a system for performing cooperative distributed control of target systems may be implemented.

FIGS. 2A-2D illustrate examples of techniques of a control state manager component to repeatedly and automatically modify the control system's usage of a battery via modifying one or more actuators that affect battery operations.

FIG. 3 is a block diagram illustrating example computing systems suitable for executing an embodiment of a system for performing cooperative distributed control of target systems in configured manners, including one or more control state manager components to repeatedly and automatically modify control components used in one or more target systems.

FIG. 4 illustrates a flow diagram of an example embodiment of a Collaborative Distributed Decision (CDD) System routine.

FIGS. 5A-5B illustrate a flow diagram of an example embodiment of a CDD Decision Module Construction routine.

FIGS. 6A-6B illustrate a flow diagram of an example embodiment of a Decision Module routine.

FIGS. 7A-7B illustrate a flow diagram of an example embodiment of a CDD Control Action Determination routine.

FIGS. 8A-8B illustrate a flow diagram of an example embodiment of a CDD Coordinated Control Management routine.

FIGS. 9A-9B illustrate a flow diagram of an example embodiment of a CDD Control State Manager routine.

FIGS. 10A-10B illustrate a flow diagram of an example embodiment of a CDD Control State Coordination Manager routine.

FIG. 11 illustrates a flow diagram of an example embodiment of a routine for a target system being controlled.

DETAILED DESCRIPTION

Techniques are described for implementing functionality for automated control systems to control or otherwise manipulate at least some operations of batteries or other electrical devices in one or more target physical systems, including to repeatedly synchronize improvements across the control systems that are being made over time in their control system functionality. In particular, while a control system is controlling usage of an associated electrical device (e.g., a battery, such as by determining whether and how much power to supply at each of a series of time points, and implementing the determined power amounts via one or more actuator components), automated modifications may be repeatedly performed to the control system's ongoing operations to improve its control functionality, such as to improve a state of the control system's operations to reduce power dissipation while performing other battery power use activities (e.g., to maximize battery life). In at least some such embodiments, the described techniques include synchronizing such a control system's state improvements with corresponding control system state improvements being performed for one or more other control systems that are each controlling one or more distinct electrical devices in the target system(s), so as to improve the collective control system functionality according to one or more criteria (e.g., to reduce power dissipation)—such synchronizing may include, for example, generating a mean field representation of the overall control system state for the target system(s) and using the mean field representation to improve the overall control system state, as discussed further below. The operations to improve a control system's operations over time may be performed in some embodiments by a control state manager component (optionally as part of or in conjunction with one or more CDD, or Collaborative Distributed Decision, systems controlling specific target systems that include one or more batteries or other electrical devices), and some or all of the described techniques to synchronize control system improvements across multiple such control systems are performed in at least some embodiments by automated operations of one or more control state coordination manager components (optionally as part of or in conjunction with those one or more CDD systems).

As one non-exclusive example, a control system may be controlling usage of a battery in a target system, including to use a DC-to-DC amplifier (e.g., a field-effect transistor, or FET, amplifier) actuator that is connected to the battery and controls an amount of electrical current and/or voltage being output from the battery (e.g., in a real-time manner and to optimize long-term operation of the battery)—if so, a control state manager component of the control system may determine and perform repeated automated modifications to the state of the control system's operations that, in at least some such embodiments, include modifying one or more state attributes of the DC-to-DC amplifier actuator to reduce power dissipation in light of other characteristics of the system, such as to adjust a level of resistance to affect an amount of power supplied and/or to adjust an amount of time during which power is supplied. In such a situation, one or more other associated control systems may be controlling operations of one or more other electrical devices (e.g., other batteries, fuel cells, solar panels, microgrids, electrical generators, engines, lighting, HVAC or other environmental systems, control systems for other physical devices, etc.) in the target system and similarly determining automated modifications to improve the state of their control system operations, and control state coordination manager components of the various control systems may synchronize the determined control system state modifications to improve the functionality across the target system (e.g., to reduce overall power dissipation for all of the electrical devices being controlled in the target system, while satisfying one or more other criteria related to functionality being provided by those electrical devices).

In at least some embodiments, the repeated automated modifications to the state of one or more control system actuator components are performed to repeatedly reduce the distance between the current electrical device performance and an idealized version of the electrical device performance (e.g., a version with no power dissipation for the electrical device), so that the ongoing usage of the electrical device is continually improved via feedback received from the ongoing electrical device usage. For example, an initial state of the control system actuator components may be thought of as providing an initial domain of possible electrical device operations, with particular control actions by the control system and the resulting functionality of the electrical device corresponding to movement within that initial domain and having an initial level of power dissipation. In such a situation, an automated modification to the state of one or more control system actuator components may be based at least in part on electrical device operations feedback received from the target system during electrical device operations in that initial domain (e.g., using sensor readings, such as temperature, voltage, current, etc. for a battery electrical device), and may involve propagating the electrical device operations to an improved domain of possible electrical device operations having a lower level of power dissipation. Such automated modifications to the state of one or more control system actuator components may be repeatedly performed based on ongoing electrical device operations feedback to further reduce the distance to the idealized version of the electrical device performance and to correspondingly reduce the power dissipation, including to dynamically adapt to various changes that may occur in the target system over time (e.g., to changing electrical device performance over time, such as for a battery electrical device due to changes in internal battery chemistry that may change current power dissipation associated with a current domain of battery operations). Additional details are described below related to repeatedly performing automated modifications to a control system's ongoing operations to improve functionality.

However, in a target system that includes multiple electrical devices, modifications to the state of control system actuator components for one electrical device may have effects on other inter-connected electrical devices, such that an improvement to the operations of one electrical device can impair the operations of one or more other electrical devices in certain circumstances. Thus, automated operations of one or more control state coordination manager components may be used to synchronize modifications to the state of control system actuator components for the multiple electrical devices (or more generally, for the overall target system)_in a manner that repeatedly reduces the distance between the current overall performance of the multiple electrical devices and an idealized version of the overall performance of the multiple electrical devices (e.g., a version with no power dissipation for the multiple electrical devices), so that the overall ongoing usage of the multiple electrical devices (e.g., of the overall target system) is continually improved via feedback received from that ongoing usage. Such automated synchronized modifications to the state of the control system actuator components for the multiple electrical devices may further dynamically adapt to various changes that may occur in the target system over time (e.g., to changing electrical device performance over time). Additional details are described below related to described techniques for repeatedly synchronizing and performing automated modifications to ongoing operations of multiple control systems for multiple electrical devices in a target system to improve overall functionality of the target system.

In addition, the described techniques may in at least some embodiments generate and use a model of an electrical device that is under control by encoding the dynamics of the electrical device (e.g., from sensory data and actions of the electrical device) in a function of the state of the electrical device referred to as a data Hamiltonian model—in particular, some characteristics of the electrical device under control may not be completely known (e.g., internal state of the electrical device), with the data Hamiltonian encoding the currently known information. Such a data Hamiltonian may be implemented as a function that captures the flow and interdependence of a data domain, and may have three types of variables (e.g., state variables, flow variables, and decision or control variables) and one or more associated goals (e.g., to maximize electrical device life while satisfying as many requests for functionality from the electrical device as possible), with behavior of the data Hamiltonian controlled at least in part by binary and other rules that specify control actions to perform in light of current state information (e.g., absolute rules that characterize the unchanging physics of a physical electrical device being controlled and have binary true/false values; hard rules that characterize the desired behavior and goals and have binary true/false values; soft rules that characterize empirical knowledge of electrical device operation, such as heuristic strategies, economic dispatch, and response to anomalies and learning strategies, and have variable, probabilistic truth values in a range [0,1], as well as associated confidence values; etc.). The control system may use the model and current state information to determine control actions to currently perform, such as in a manner to satisfy defined constraints and other goals of the control system in light of its current state, while attempting to satisfy the requested output or other desired operation of the electrical device if possible. Additional details are included below regarding the generation and use of such electrical device models.

The described techniques involving the use of control state coordination manager techniques may provide a variety of benefits and advantages. In particular, many traditional control system approaches involving batteries or other electrical devices have been ineffective for controlling complex systems in which internal state information cannot be determined, and such problems are increased when managing multiple electrical devices whose operations can have effects on each other—conversely, the use of the described control state coordination manager techniques overcome such problems based at least in part by, while repeatedly improving the operation of particular control systems via feedback from ongoing operations used to reduce the difference between current and ideal operations of those control systems, further synchronizing the various control system improvements to improve overall functionality of a target system with multiple electrical devices in order to reduce the difference between current and ideal operations of the overall target system. Such traditional control system approaches typically involve the system designers beginning with requirements for behavior of an electrical device, using the requirements to develop a static model of the electrical device, and attempting to optimize the run-time electrical device system operations in light of defined criteria. Conversely, in at least some embodiments, the described control state coordination manager techniques do not need to use such criteria, nor to develop such a resulting static model, nor to do such optimization instead, an idealized behavior of each particular electrical device is expressed and used to create an idealized behavioral model (e.g., expressed as an idealized data Hamiltonian system model), and information used from a control system state improvement feedback loop during run-time operation is used to improve the functionality that the control system (e.g., continuously) by repeatedly reducing the difference between a domain of current electrical device operations and a domain of idealized electrical device operations, with the improvements of multiple such control systems being synchronized to improve overall functionality of a target system with multiple electrical devices by repeatedly reducing the overall differences between a domain of current operations for the target system and a domain of idealized target system operations. In this manner, as the overall differences are reduced, the effects of the control actions determined by the automated control systems for the multiple electrical devices of the target system more accurately control the target system to approach the idealized overall behavior.

FIG. 1A includes an example diagram 195 illustrating how a first control state manager component may be used to improve functionality of a control system that is controlling a target system using a first electrical device 195 b, such as for a first decision module that contains the first control state manager component. FIG. 1A further illustrates how a control state coordination manager component (e.g., of the first decision module) may be used to synchronize such control state improvements with those made by other associated control state manager components for other electrical devices (e.g., for multiple electrical devices that are part of a target system, and each has an associated control state manager component in a separate decision module). The first electrical device may be a battery in at least some embodiments, as discussed in greater detail elsewhere herein (including with respect to the examples of FIGS. 2A-2D), although in other situations the electrical device may be part of or otherwise have other forms (e.g., a solar panel, wind turbine, inverter, fuel cell, solid waste generator, motor, computing device, other active loads, etc.).

In this example, a control system 195 a performs a control loop to control ongoing operation of the electrical device 195 b of the target system, such as to drive the target system to a desired dynamic behavior. In particular, the control system may include a CDD agent (as discussed in greater detail below with respect to FIGS. 1B-1C, as well as elsewhere herein), and a model of the target system's electrical device 195 b that was previously generated based in part on data obtained from actual operation of the target system over time (such as to identify some or all inputs supplied to the electrical device 195 b; resulting outputs from the electrical device 195 b, such as sensor data measured regarding operations of the electrical device 195 b from sensors 195 d, etc.) the system model is a representation of the electrical device 195 b and its operations, and in this example is in the form of a total data Hamiltonian function H_(T), as discussed in greater detail below. As part of the operation of the control system 195 a, it receives a target signal that represents a request for a desired output or other desired operation of the electrical device 195 b of the target system, and uses information from its overall system model to determine an operations control signal (e.g., an energy supply control signal if the control system determines to satisfy the request, optionally with an amount of energy to supply) to send to the electrical device that satisfies defined constraints and other goals of the control system in light of its current state, while attempting to satisfy the desired output or other desired operation of the target signal if possible. The electrical device receives the control signal, and performs a corresponding output 195 f as appropriate, with that output and/or other characteristics of the electrical device being measured at least in part by the one or more sensors 195 d (e.g., a suite of multiple passive sensors). The sensors 195 d may further supply their measured readings to the control system 195 a, such as to update corresponding state information in the system model, with the control system 195 a continuing to control operation of the electrical device 195 b for further target signals (e.g., in a continuous or substantially continuous manner, and such as based on a system model that is updated in a continuous or substantially continuous manner based at least in part on readings from the sensors 195 d).

In addition to the control loop used to control the operations of the electrical device 195 b, FIG. 1A further illustrates a first control state manager component 195 c that participates in a control state improvement feedback loop to repeatedly (e.g., continuously) improve functionality of the control system, by adjusting attributes or other state information of one or more control system actuators that regulate operation of the electrical device, such as to affect how and whether operations of the control system actuator(s) are performed. In the example of FIG. 1A, the control system includes one or more control system actuators 195 e that optionally receive the operations control signal from the control system and modify activities of the control system actuator(s) to dynamically regulate the behavior of the electrical device. As previously noted, the control system actuator(s) may include, for example, a DC-to-DC amplifier that is connected to the electrical device and controls an amount of electrical current and/or voltage being output from the electrical device, such as by providing a configurable amount of resistance—if so, the adjustments by the control state manager component 195 c to the attributes or other state information of the control system actuator(s) 195 e may include, for example, changing a level of resistance and/or an amount of time that a resistance level is used. In particular, the control state manager component receives feedback from the sensors 195 d corresponding to current operation of the electrical device 195 b as regulated by the control system actuator(s) 195 e, uses the feedback as part of determining a current domain of electrical device operations (e.g., corresponding to a current amount of power dissipation that occurs from the electrical device operations), propagates current values for state, momentum and control values for the electrical device operations over a defined time window toward an idealized domain of electrical device operations (e.g., corresponding to no power dissipation from electrical device operations), and uses a weighted average of the propagated values to determine modifications and other adjustments to make to the state attributes of the control system actuator(s) to improve the functionality of the control system (e.g., to reduce the power dissipation from the electrical device operations). Additional details are included below regarding the operations of the control state manager component.

With respect to such a target system that includes an electrical device, the target system may, for example, include one or more batteries used to store and provide electrical power (e.g., for a local load, for an electrical grid that supports various loads in various locations, etc.), and automated operations to control the target system may include using characteristics of at least one such battery in the target system to perform automated control of DC (direct current) power that is provided from and/or stored by that battery. In such embodiments, the automated operations of one or more CDD agents may include generating an overall system model of battery performance by receiving information about inputs to, outputs from, control signal instructions provided to and other attributes related to the one or more batteries (e.g., electrical current and/or voltage being output for use, electrical current and/or voltage being input for storage, temperature readings external to the one or more batteries as part of their surrounding environment, etc.), and using such information as part of modeling current operational characteristics of the one or more batteries given such modeled information, the CDD agent(s) that control the one or more batteries may then use such information to make decisions on current and/or future control actions in a manner that reflects actual behavior of the target system.

In the illustrated example of FIG. 1A, the target system further includes one or more additional electrical devices that are controlled by one or more additional control state manager components using one or more additional control system actuator elements. In particular, one or more additional decision modules 124 x are illustrated that each uses an associated control state manager component 185 x to control one or more associated control elements 185 y for one or more electrical devices in the target system—although less details are illustrated for the other decision modules and associated target system elements for the sake of brevity, each control state manager component 185 x and decision module 124 x may perform operations similar to those illustrated for control system 195 a and control state manager component 195 c.

FIG. 1A further illustrates a control state coordination manager component 188 that performs some or all operations to synchronize 180 control system state improvements between the decision module(s) 124 x and first decision module (not shown) that includes the control system 195 a and control state manager component 195 c—for example, the control state coordination manager component 188 may in some embodiments be a component local to the first decision module to manage the synchronization operations for the first decision module in a distributed collaborative manner with other control state coordination manager components (not shown) of the other decision modules 124 x, although in other embodiments one or more control state coordination manager components that are not specific to particular decision modules may instead perform the synchronization operations for multiple such decision modules and their control state manager components. Additional details are included below related to performance of such synchronization operations.

However, before further discussion of the control state coordination manager component and its functionality, a more general description of the control of target systems using such representations and other models is provided.

In particular, FIG. 1B is a network diagram illustrating an example environment in which a system for performing cooperative distributed control of one or more target systems may be configured and initiated. An embodiment of a CDD system 140 is executing on one or more computing systems 190, including in the illustrated embodiment to operate in an online manner and provide a graphical user interface (GUI) (not shown) and/or other interfaces 119 to enable one or more remote users of client computing devices 110 to interact over one or more intervening computer networks 100 with the CDD system 140 to configure and create one or more decision modules to include as part of an automated control system to use with each of one or more target systems to be controlled. While not illustrated in FIG. 1B, the CDD system 140 may include and use one or more control state manager components and/or one or more control state coordination manager components as discussed herein, such as to include one or more such control state manager components and/or control state coordination manager components in one or both of the automated control systems 1 and 2.

Target system 1 160 and target system 2 170 are example target systems illustrated in this example, although it will be appreciated that only one target system or numerous target systems may be available in particular embodiments and situations, and that each such target system may include a variety of mechanical, electronic, chemical, biological, and/or other types of components to implement operations of the target system in a manner specific to the target system. In this example, the one or more users (not shown) may interact with the CDD system 140 to generate an example automated control system 122 for target system 1, with the automated control system including multiple decision modules (or “agents”) 124 in this example that will cooperatively interact to control portions of the target system 1 160 when later deployed and implemented. The interactions of the users with the CDD system 140 to create the automated control system 122 may involve a variety of interactions over time, including in some cases independent actions of different groups of users. In addition, as part of the process of creating and/or training or testing automated control system 122, it may perform one or more interactions with the target system 1 as illustrated, such as to obtain partial initial state information, although some or all training activities may in at least some embodiments include simulating effects of control actions in the target system 1 without actually implementing those control actions at that time. In some embodiments and situations, such initial user interactions may be used to generate an initial rule-based overall system model of a target system that is based at least in part on binary rules.

After the automated control system 122 is created, the automated control system may be deployed and implemented to begin performing operations involving controlling the target system 1 160, such as by optionally executing the automated control system 122 on the one or more computing systems 190 of the CDD system 140, so as to interact over the computer networks 100 with the target system 1. In other embodiments and situations, the automated control system 122 may instead be deployed by executing local copies of some or all of the automated control system 122 (e.g., one or more of the multiple decision modules 124) in a manner local to the target system 1, as illustrated with respect to a deployed copy 121 of some or all of automated control system 1, such as on one or more computing systems (not shown) that are part of or otherwise associated with the target system 1. Each such decision module may, for example, perform activities similar to those of control system 195 a of FIG. 1A, such as with respect to a respective electrical device being controlled by that decision module. In addition, in embodiments and situations in which initial user interactions are used to generate an initial rule-based system model of a target system using binary rules, the initially deployed automated control system 122 may be based on such an initial rule-based system model, and data from the operation of the target system under control of that initially deployed automated control system 122 may be gathered and used to include information about current characteristics of the target system in a revised model of the target system, and/or the functionality of the control system may be improved over time using a control state improvement feedback loop under control of a control state manager component as discussed elsewhere herein.

In a similar manner to that discussed with respect to automated control system 122, one or more users (whether the same users, overlapping users, or completely unrelated users to those that were involved in creating the automated control system 122) may similarly interact over the computer network 100 with the CDD system 140 to create a separate automated control system 126 for use in controlling some or all of the target system 2 170. In this example, the automated control system 126 for target system 2 includes only a single decision module (or “agent”) 128 that will perform all of the control actions for the automated control system 126, such as in a manner similar to that illustrated for control system 195 a of FIG. 1A. The automated control system 126 may similarly be deployed and implemented for target system 2 in a manner similar to that discussed with respect to automated control system 122, such as to execute locally on the one or more computing systems 190 and/or on one or more computing systems (not shown) that are part of or otherwise associated with the target system 2, although a deployed copy of automated control system 2 is not illustrated in this example. It will be further appreciated that the automated control systems 122 and/or 126 may further include other components and/or functionality that are separate from the particular decision modules 124 and 128, respectively, although such other components and/or functionality are not illustrated in FIG. 1B.

The network 100 may, for example, be a publicly accessible network of linked networks, possibly operated by various distinct parties, such as the Internet, with the CDD system 140 available to any users or only certain users over the network 100. In other embodiments, the network 100 may be a private network, such as, for example, a corporate or university network that is wholly or partially inaccessible to non-privileged users. In still other embodiments, the network 100 may include one or more private networks with access to and/or from the Internet. Thus, while the CDD system 140 in the illustrated embodiment is implemented in an online manner to support various users over the one or more computer networks 100, in other embodiments a copy of the CDD system 140 may instead be implemented in other manners, such as to support a single user or a group of related users (e.g., a company or other organization), such as if the one or more computer networks 100 are instead an internal computer network of the company or other organization, and with such a copy of the CDD system optionally not being available to other users external to the company or other organizations. In addition, the CDD system 140, each of its components (including component 142 and optional other components 117, such as one or more CDD Control Action Determination components and/or one or more CDD Coordinated Control Management components and/or one or more CDD Control State Manager components and/or one or more CDD Control State Coordination Manager components), each of the decision modules, and/or each of the automated control systems may include software instructions that execute on one or more computing systems (not shown) by one or more processors (not shown), such as to configure those processors and computing systems to operate as specialized machines with respect to performing their programmed functionality.

As noted above, various types of data may be obtained and used as part of modeling operational characteristics of a target system in a general overall model, including information about prior input data to the target system and resulting behavior of the target system. In some embodiments and situations, such data may include data that is gathered in an automated manner from one or more types of hardware sensors, and in some embodiments and situations, such data may include information about actions of human users or otherwise information about such humans. The term “sensor” and “sensor data” as used herein generally refers to such data regardless of source or type, including data from hardware sensors, unless otherwise indicated with respect to a particular situation. In addition, the improvements to control system functionality that are performed by a control state manager component may be performed to complete or repair or otherwise address conflicts in state information for one or more parts of the target system, such as from lack of sufficient internal state structure information or other information, and to enable learning of or other improvements to results of performing control actions. Similarly, the synchronization of control state improvements that are performed by a control state coordination manager component may in at least some embodiments be performed to complete or repair or otherwise address conflicts in state information across multiple parts of the target system, and to enable learning of or other improvements to results of performing control actions.

FIG. 1C is a network diagram illustrating an example environment in which a system for performing cooperative distributed control of target systems may be implemented, and in particular continues the examples discussed with respect to FIG. 1B. In the example environment of FIG. 1C, target system 1 160 is again illustrated, with the automated control system 122 (whether an initial or revised version) now being deployed and implemented to use in actively controlling the target system 1 160. In the example of FIG. 1C, the decision modules 124 are represented as individual decision modules 124 a, 124 b, etc., to 124 n, and may be executing locally to the target system 1 160 and/or in a remote manner over one or more intervening computer networks (not shown). In the illustrated example, each of the decision modules 124 includes a local copy of a CDD Control Action Determination component 144, such as with component 144 a supporting its local decision module 124 a, component 144 b supporting its local decision module 124 b, and component 144 n supporting its local decision module 124 n. Similarly, the actions of the various decision modules 124 are coordinated and synchronized in a peer-to-peer manner in the illustrated embodiment, with each of the decision modules 124 including a copy of a CDD Coordinated Control Management component 146 to perform such synchronization, with component 146 a supporting its local decision module 124 a, component 146 b supporting its local decision module 124 b, and component 146 n supporting its local decision module 124 n. One or more of the decision modules 124 may further include a local copy of a CDD Control State Manager component 185, such as to use feedback to learn improved functionality for at least some of the target system 1 (e.g., for a respective subset of the target system 1 that is controlled by that decision module), and with component 185 a supporting its local decision module 124 a, component 185 b supporting its local decision module 124 b, and component 185 n supporting its local decision module 124 n in this example. Similarly, one or more of the decision modules 124 may further include a local copy of a CDD Control State Coordination Manager component 185, such as to synchronize control state improvements made by one or more control state manager components across at least some of the target system 1 (e.g., for a respective subset of the target system 1 that is controlled by that decision module), and with component 185 a supporting its local decision module 124 a, component 185 b supporting its local decision module 124 b, and component 185 n supporting its local decision module 124 n in this example. While the control state manager components and control state coordination manager components are grouped together in this example, it will be appreciated that they may be implemented as separate components in at least some embodiments, or may have only one of the components in other embodiments.

As the decision modules 124 and automated control system 122 execute, various interactions 175 between the decision modules 124 are performed, such as to share information about current models and other state of the decision modules to enable cooperation and coordination between various decision modules (e.g., for a particular decision module and its control action determination component to operate in a partially synchronized consensus manner with respect to one or more other decision modules and their control action determination components, and in some situations in a fully synchronized manner in which the consensus actions of all of the decision modules' control action determination components converge). In addition, other interactions 186 may similarly be performed between some or all of the control state coordination manager components, such as to enable cooperation and coordination between various control state manager components (e.g., for a particular control state manager component of a particular decision module to operate in a partially synchronized consensus manner with respect to one or more other control state manager components of other decision modules, and in some situations in a fully synchronized manner in which the consensus control state improvement actions of all of the decision modules' control state manager components converge). During operation of the decision modules 124 and automated control system 122, various state information 143 may be obtained by the automated control system 122 from the target system 160, such as initial state information and changing state information over time (e.g., from passive and/or active sensors, not shown), and including outputs or other results in the target system 1 from control actions performed by the decision modules 124.

The target system 1 in this example includes various control elements 161 that the automated control system 122 may manipulate, and in this example each decision module 124 may have a separate group of one or more control elements 161 that it manipulates (such that decision module A 124 a performs interactions 169 a to perform control actions A 147 a on control elements A 161 a, decision module B 124 b performs interactions 169 b to perform control actions B 147 b on control elements B 161 b, and decision module N 124 n performs interactions 169 n to perform control actions N 147 n on control elements N 161 n). Such control actions affect the internal state 163 of other elements of the target system 1, including optionally to cause or influence one or more outputs 162. As operation of the target system 1 is ongoing, at least some of the internal state information 163 is provided to some or all of the decision modules to influence their ongoing control actions, with each of the decision modules 124 a-124 n possibly having a distinct set of state information 143 a-143 n, respectively, in this example.

As discussed in greater detail elsewhere, each decision module 124 may use such state information 143 and a local sub-model 145* of an overall system model for the target system to determine particular control actions 147 to next perform, such as for each of multiple time periods, although in other embodiments and situations, a particular automated control system may perform interactions with a particular target system for only one time period or only for some time periods. For example, the local CDD Control Action Determination component 144 for a decision module 124 may determine a near-optimal local solution for that decision module's local model 145, and with the local CDD Coordinated Control Management component 146 determining a synchronized consensus solution to reflect other of the decision modules 124, including to update the decision module's local sub-model 145 based on such local and/or synchronized solutions that are determined. Thus, during execution of the automated control system 122, the automated control system performs various interactions with the target system 160, including to request state information, and to provide instructions to modify values of or otherwise manipulate control elements 161 of the target system 160. For example, for each of multiple time periods, decision module 124 a may perform one or more interactions 169 a with one or more control elements 161 a of the target system, while decision module 124 b may similarly perform one or more interactions 169 b with one or more separate control elements B 161 b, and decision module 124 n may perform one or more interactions 169 n with one or more control elements N 161 n of the target system 160. In other embodiments and situations, at least some control elements may not perform control actions during each time period.

One or more control state manager components 185 may further perform activities during such control of the target system 160, such as to determine and subsequently use control state improvement information to improve functionality of the target system (e.g., to modify or otherwise adjust attributes or other state information of control system actuators that regulate activities of the target system or particular parts of it). As part of doing so, each control state manager component may use a local sub-model (not shown) of control system state for the target system to determine particular control state improvement actions to perform 189, such as for each of multiple time periods and for corresponding control system actuator elements 161, although in other embodiments and situations, a particular control state manager component may determine and perform interactions with a particular target system for only one time period or only for some time periods. In addition, after a control state manager component has determined a control system state improvement, a local CDD Control State Coordination Manager component 185 may determine a synchronized consensus solution for control state improvements that reflects other of the decision modules' control state manager components determined control state improvements, including to update a local decision module's local sub-model of control system state based on such local and/or synchronized solutions that are determined. Thus, during execution of the automated control system 122, the automated control system performs various interactions 189 with the target system 160 to improve control system state—for example, for each of multiple time periods, decision module 124 a may perform one or more interactions 189 a with state information for one or more control elements 161 a of the target system, while decision module 124 b may similarly perform one or more interactions 189 b with state information for one or more separate control elements B 161 b, and decision module 124 n may perform one or more interactions 189 n with state information for one or more control elements N 161 n of the target system 160. In other embodiments and situations, at least some control state manager components and/or control state coordination manager components may not perform actions during each time period to improve control state information.

In addition, while example target system 2 170 of FIG. 1B is not illustrated in FIG. 1C, further details are illustrated for decision module 128 of automated control system 126 for reference purposes, although such a decision module 128 would not typically be implemented together with the decision modules 124 controlling target system 1. In particular, the deployed copy of automated control system 126 includes only the single executing decision module 128 in this example, although in other embodiments the automated control system 126 may include other components and functionality. In addition, since only a single decision module 128 is implemented for the automated control system 126, the decision module 128 includes a local CDD Control Action Determination component 184, any may optionally further include a local CDD control state manager component (not shown), but does not in the illustrated embodiment include any local CDD Coordinated Control Management component (since there are not other CDD Control Action Determination components of other decision modules with which to synchronize and interact) or any local CDD Control State Coordination Manager component (since there are not other control state manager components of other decision modules with which to synchronize and interact).

While not illustrated in FIGS. 1B and 1C, the distributed nature of operations of automated control systems such as those of 122 allow partially decoupled operations of the various decision modules, include to allow modifications to the group of decision modules 124 to be modified over time while the automated control system 122 is in use, such as to add new decision modules 124 and/or to remove existing decision modules 124. In a similar manner, changes may be made to particular decision modules 124 and/or 128, such as to change rules or other restrictions specific to a particular decision module and/or to change goals specific to a particular decision module over time, with a new corresponding model being generated and deployed within such a decision module, including in some embodiments and situations while the corresponding automated control system continues to control operations of a corresponding target system. In addition, improvements to functionality of particular decision modules may reflect operations of one or more control state manager components to adjust state information for one or more control system actuators that regulate one or more respective control elements of the target system at one or more times. Moreover, while each automated control system is described as controlling a single target system in the examples of FIGS. 1B and 1C, in other embodiments and situations, other configurations may be used, such as for a single automated control system to control multiple target systems (e.g., multiple inter-related target systems, multiple target systems of the same type, etc.), and/or for multiple automated control systems to operate together to control a single target system, such as by each operating independently to control different portions of that target control system. It will be appreciated that other configurations may similarly be used in other embodiments and situations.

For illustrative purposes, some embodiments are described below in which specific types of data is gathered and used in particular manners to perform specific types of control actions for specific types of target systems, including via particular types of adjustments to particular types of control system actuator(s) to improve particular types of functionality. However, it will be understood that such described techniques may be used in other manners in other embodiments, including with other types of target systems, and that the invention is thus not limited to the exemplary details provided.

As noted above, in at least some embodiments, the model of a target system with an electrical device to be controlled is encoded as a data Hamiltonian model that is a function of three types of variables (state variables, momentum variables and control variables), and is composed of three additive elements (the physical model, the constrained model and the learned model). The physical and constrained models are determined respectively by the physical principles characterizing the system and operational requirements. In particular, the three types of variables used in the function for the data Hamiltonian model include a vector defining the state of the electrical device, a vector defining the momentum of the electrical device, and a vector of action variables that control the electrical device. The additive elements that compose the data Hamiltonian model include at least Hamiltonians H₀ and H_(C), where H₀ is the physical Hamiltonian of the electrical device, and H_(C) is the constrained Hamiltonian representing the known operational and requirement constraints, with the total Hamiltonian model in the following form: H_(T)=H₀+H_(C). H₀ and H_(C) are determined from stored operational rules and historical data of the electrical device. The total Hamiltonian model H_(T) has the same properties of the Hamiltonian of classic mechanics, but adapted to electrical devices. In addition to the total Hamiltonian model H_(T) that characterizes the dynamic target system, a control system implemented by the described techniques may in some embodiments use a specified desired behavior Hamiltonian H_(D), which reflects the desired behavior of the system under control, and affects the dynamics of the control signal produced by the control system.

The total Hamiltonian model H_(T) encodes the evolution of the target system under control, with the evolution represented in the form of the extended Hamilton Jacobi equations, as follows:

${\frac{{dq}(t)}{dt} = \frac{\partial H_{T}}{\partial{p(t)}}}{\frac{{dp}(t)}{dt} = {- \frac{\partial H_{T}}{\partial{q(t)}}}}{\frac{{du}(t)}{dt} = {{- \Gamma}*{\frac{\partial}{\partial u}\left( \frac{{d\left( {H_{T} - H_{D}} \right)}^{2}}{dt} \right)}}}$ where q(t) is the state vector of the electrical device being learned, p(t) is its momentum, and u(t) is the control action vector. The first two equations are classic evolution equations of the dynamics of the dynamic target system, and the last equation describes control of the electrical device (e.g., of a battery electrical device on the DC side) to satisfy constraints and approximate the desired behavior represented by H_(D). The parameter is an empirical parameter to ensure stability of the control system.

Turning now to FIGS. 2A-2D, these figures illustrate examples of a control state manager component performing techniques to improve functionality of a control system that is controlling a battery electrical device, by repeatedly adjusting state of one or more control system actuators in order to reduce the distance between the current battery performance and an idealized version of the battery performance. It will be appreciated that similar techniques may be used with other types of electrical devices.

FIG. 2A has similarities to FIG. 1A, but further illustrates the use of a control state manager component to improve control system functionality in controlling use of a lithium ion battery system, including by improvements to control system state (e.g., improvements to one or more control system actuators for the battery system), as well as use of a control state coordination manager component to synchronize control state improvements determined by multiple control state manager components. For example, in at least some embodiments involving a physical target system that includes one or more batteries used to store and provide electrical power, the automated operations to control the target system may include using characteristics of each battery's state to perform automated control of DC (direct current) power that is provided from the battery—in some such embodiments, such control may include using a DC-to-DC amplifier (e.g., a field-effect transistor, or FET, amplifier) connected to the battery to control an amount of electrical current and/or voltage being output from the battery (e.g., in a real-time manner and to optimize long-term operation of the battery), such as FET amplifier actuator 205 e of FIG. 2A. Such a DC-to-DC amplifier may, for example, be part of a buck converter (or step-down converter) that steps down voltage while stepping up current from its input (supply) to its output (load) and/or be part of a boost converter (or step-up converter) that steps up voltage while stepping down current from its input (supply) to its output (load), referred to generally at times herein as a “boost/buck controller” or “buck/boost controller”. A system that includes one or more batteries to be controlled may further include additional components in some embodiments and situations, such as one or more electrical sources and/or one or more electrical loads, with one non-exclusive example of such a type of system being a micro-grid with one or more home or business electrical power systems that may optionally include electrical generation sources (e.g., solar panels, wind turbines, etc.) as well as electrical load from the house or business.

As part of controlling use of a lithium ion battery system in FIG. 2A, various illustrated components interact to control operations of the battery according to one or more defined goals in light of defined constraints, rules and other information, as discussed elsewhere herein. In some embodiments, the automated activities to control the battery may be performed in a real-time manner and/or to optimize long-term operation of the battery (e.g., the life of the battery), while satisfying as many external requests for power (e.g., from a utility or other load 205 f to which the battery can supply power) as is possible (e.g., at least a defined percentage or quantity of such requests) for example, the control system 205 a may attempt to fully or partially satisfy a request from the utility for power in a real-time manner if the request can be satisfied in a way that also satisfies other constraints on the battery performance given the current state of the battery and the defined goal(s), such as to enable the battery to operate in a desired non-saturation range or level (e.g., with respect to an internal temperature of the battery and/or internal chemistry of the battery). In addition, the control commands sent from the control system 205 a to battery 205 b may have various forms in various embodiments, such as to specify an amount of power to be generated as DC output of the battery, and/or for the battery to receive electrical power from one or more sources (not shown) to be stored for later use (e.g., at different time periods, or otherwise at different times). The specified power amount to be generated may include information indicating, for example, to increase or decrease the power being output by a specified amount, or to not change the power output. The output of the battery may serve to provide power to one or more loads 205 f (e.g., an electrical grid associated with the utility), and in at least some embodiments may be connected to an inverter/rectifier component (not shown) to convert the power output of the battery to AC power to support corresponding loads such an inverter may, for example, control power being provided from the battery by regulating voltage and/or frequency of the AC power. Similarly, input to the battery may serve to receive power from one or more sources (not shown), and in at least some embodiments may be connected to an inverter/rectifier component (not shown) to convert AC power input from the sources to DC power for the battery such a rectifier may, for example, control power being provided to the battery by regulating voltage and/or frequency of the AC power.

In the illustrated example of FIG. 2A, decision module A 124 a includes a control system 205 a and a control state manager component 205 c, with the decision module using two loops (a control loop and a control state improvement feedback loop) to control operation of a lithium ion power battery 205 b. The control loop has the functionality to drive the battery system to a desired dynamic behavior, which in this example depends on two pieces of information, with a target signal telling the control system 205 a the current desired battery output or other battery operation, and the control system using a current total Hamiltonian model that characterizes the battery system being controlled. The command signal generated by the control system represents actions for the battery to perform to satisfy the operational constraints (e.g., to protect the battery and extend battery life) and desired dispatch considerations (e.g., as dictated by a utility or other load 205 f requesting power from the battery). Thus, the target signal to the control system 205 a represents a desired power delivery of the battery (or receipt by the battery) and information about longevity targets, and the control system uses dynamics information from the current status of the battery, such as given by voltage and current sensors, to determine control commands provided to the battery (e.g., whether to supply or receive power, how much power to supply, etc.). To maximize the useful lifetime, the control system also uses information about the model changes of the battery as a function of level of charge, demand, temperature, etc., as well as optionally information about the ions and electrochemical activity within the battery if available. The energy supply signal between the battery/actuator and utility/load is either an output power signal generated by the battery and sent to the utility or load 205 f, or an input power signal for charging the battery from the utility or load, as regulated by the FET amplifier actuator 205 e. In addition, the passive sensor suite 205 d provides feedback information about the current system operation to the control system and to the control state manager component 205 c.

The control state improvement feedback loop, which includes the control state manager component 205 c operating to improve functionality of the control system, also uses feedback information from the sensors 205 d regarding the current status of the battery system to improve operations of the control system's FET amplifier actuator 205 e. In particular, the control system uses the actuator in this example to actively control the impedance that the battery system “sees”. The battery output (charging or discharging) is optimized for factors such as load satisfaction and/or longevity, with economic factors also optionally used. The impedance actuator 205 e may be directly controlled by the control system and in series with the battery, such that the impedance is decreased when more power is desired from the battery, and is increased when less power is desired. In at least some embodiments, the impedance is implemented electronically with switches that may be used to increase the dissipation. The improvements provided by the control state improvement feedback loop are used in this example embodiment to adjust the impedance (or resistance) to approach an optimal level given a current state of the battery 205 b, and thus to maximize useful lifetime of the battery by improving efficiency of control of the DC side of the battery and reducing energy waste.

With respect to an initial model of the battery that is used by the control system 205 a, it may in some embodiments be a generic battery model that is applicable to any type of battery, while in other embodiments an initial battery model may be used that is specific to a type of the battery (e.g., a type of chemical reaction used to store and/or generate electricity, such as lithium ion or nickel cadmium), while in yet other embodiments an initial battery model may be used that is designed and/or configured specifically for the particular battery in use. Thus, such an initial battery model that is initially employed in a particular system with a particular battery may be updated over time, such as to reflect improvements from tuning parameters of the model and/or improvements to the underlying structure of the model when updating a model to a particular battery and/or system, the updating operations may in some embodiments be performed initially in a learning phase before using the automated control system to control the battery, and/or in some embodiments may be performed continuously or periodically while the automated control system is controlling the battery (e.g., to reflect changes over time in an impedance profile of the battery). Additional details are included elsewhere herein regarding such models, including their construction and use.

FIG. 2A further illustrates one or more additional electrical devices with associated control elements 124 y that are controlled via control activities determined and initiated by one or more other decision modules 124 x, with those decision modules 124 x further including one or more additional control state manager components 185 x to determine and implement control system state improvements for the electrical device control elements 124 y. The other decision modules 124 x also include one or more other decision module components 185 y (e.g., control action determination components, coordinated control management components, control state coordination manager components, etc.). Although less details are illustrated for the other decision modules and associated target system elements for the sake of brevity, each control state manager component 185 x and decision module 124 x may perform operations similar to those illustrated for control system 205 a and control state manager component 205 c. The control state coordination manager component 188 may further perform operations 180 to synchronize the control state improvements of the various control state manager components 185 x and 205 c, optionally in cooperation with one or more other control state coordination manager components (not shown), in a manner similar to that discussed with respect to FIG. 1A. For example, the control state coordination manager component 188 may in some embodiments be a component local to the decision module A 124 a to manage the synchronization operations for the decision module in a distributed collaborative manner with other control state coordination manager components (not shown) of the other decision modules 124 x, although in other embodiments one or more control state coordination manager components that are not specific to particular decision modules may instead perform the synchronization operations for multiple such decision modules and their control state manager components.

In addition, in some embodiments the control system may be implemented as multiple separate components (e.g., with a battery controller sub-component implemented in whole or in part in hardware and/or firmware that is attached to the battery or otherwise at a location of the battery, and with other portions of the control system (agent) implemented in part by software instructions executing on one or more computing systems remote from the battery location and optionally communicating with the battery controller over one or more intervening computer networks), while in other embodiments the control system agent may be implemented as a single component (whether at the location of the battery or remote from it). Similarly, while in some embodiments the control state manager component, control state coordination manager component and/or control system agent may be implemented as separate components (e.g., with the control state manager component and/or control state coordination manager component implemented in whole or in part at the location of the battery, and/or in whole or in part at a remote location), in other embodiments the control system, control state coordination manager component and control state manager component may be implemented as a single component (whether at the location of the battery or remote from it). In addition, while not illustrated with respect to FIG. 2A, multiple batteries (e.g., tens, hundreds, thousands, millions, etc.) may each have an associated control agent that controls actions of that battery in some embodiments, and with the various batteries acting together in a coordinated manner to supply aggregate power to the utility or to other entities. In such embodiments, the utility or other external entity may send synchronization and monitoring signals for use by the various systems including the batteries, and the multiple control agents associated with the various batteries may interact to exchange information and maintain at least partial coordination between the operations of the batteries.

Some further aspects of performing automated operations to control such a target system with one or more batteries and/or other types are target systems are included in U.S. patent application Ser. No. 15/096,091, filed Apr. 11, 2016 and entitled “Using Battery DC Characteristics To Control Power Output;” and in U.S. patent application Ser. No. 15/410,647, filed Jan. 19, 2017 and entitled “Using Sensor Data To Assist In Controlling A Target System By Modeling The Functionality Of The Target System,” which claims the priority benefit of U.S. Provisional Patent Application No. 62/336,418, filed May 13, 2016 and entitled “Using Sensor Data To Assist In Controlling A Target System By Modeling The Functionality Of The Target System;” and in U.S. patent application Ser. No. 16/103,788, filed Aug. 14, 2018 and entitled “Using Battery State Excitation To Control Battery Operations”; each of which is hereby incorporated by reference in its entirety.

In at least some embodiments, initial modeling of a state of a target system is performed using one or more data Hamiltonian functions, and the described techniques include a control state manager component using one or more types of sensor data to improve functionality of the control system during its operation. A CDD system controlling such a target system may, in at least some embodiments and situations, implement multiple CDD decision modules or sub-systems (also referred to at times herein as CDI, or Collaborative Distributed Inferencing, control agents, such that a particular embodiment of the CDD system with one or more such CDI control agents may be referred to as a CDI system) to distribute the control and management through an agent-based network with synchronization via a mean field Hamiltonian approach, such as with each agent characterized by a data Hamiltonian that defines the dynamics and interaction of one or more corresponding components in the target system, and with each such data Hamiltonian of an agent being dynamically computed from sensory data and actions. Such a data Hamiltonian (for a single target system component) and/or mean field Hamiltonian (for multiple coordinated target system components) can be thought of as a mathematical function that helps navigate a query through huge bodies of information by defining a spectrum of possible outcomes, including to model history, current situation and possible options. Similarly, one or more control state coordination manager components may use a mean field Hamiltonian approach to synchronize control state improvements determined by control state manager components of multiple decision modules (or CDI agents). Non-exclusive example embodiments using such techniques are further described herein, but it will be appreciated that other embodiments may differ in one or more manners from these example embodiments.

A data Hamiltonian may be implemented as a function that captures the flow and interdependence of a data domain, and may have three types of variables (e.g., state variables, flow variables, and decision or control variables). A CDI control agent may be implemented as a control state manager engine operating in a data domain that belongs to a multi-data domain, and the CDD system may be implemented as a formal, distributed control state manager rule-based process for resolving time-based queries from a distributed agent-based domain in real-time. A CDI control agent of the CDD system may be implemented using Horn clause rules of three types, as follows: absolute rules that characterize the physics of a physical target system being controlled (or otherwise describe unchangeable rules in other types of target systems), and have truth value equal to true in any Hamiltonian realization (e.g., a value of 0 for false or 1 for true); hard rules that characterize the desired behavior and goals, and have truth value equal to true in any Hamiltonian realization (e.g., a value of 0 for false or 1 for true); and soft rules that characterize the empirical knowledge of the operation, heuristic strategies, economic dispatch, and response to anomalies and learning strategies, and have a variable, probabilistic truth value in [0,1], as well as an associated confidence value for that variable, probabilistic truth value in some embodiments. Meta-rules that are special kinds of soft rules may be used to transform sensory data and desired behavior into constraint data Ham iltonians. Soft rules can be thought of as being used to navigate queries through “gradients” (information that is neither true nor false), as a means of identifying what areas of data are pertinent to any given query. Such conversion of constraints for a CDI control agent may include the following: transform truth values {0,1} to a [0,1] interval; transform variables and parameters to continuous variables and parameters; transform absolute rules to equality constraints; transform hard rules to equality constraints; transform soft rules to inequality constraints; transform inclusion sets to functional forms; transform algorithms to differential equations; etc.

Some further aspects of implementing such techniques for modeling target systems and performing automated operations to control such target systems, including in a distributed manner using multiple agents, are included in U.S. patent application Ser. No. 14/746,738, filed Jun. 22, 2015 and entitled “Cooperative Distributed Control Of Target Systems;” in U.S. Patent Application No. 62/182,968, filed Jun. 22, 2015 and entitled “Applications Of Cooperative Distributed Control Of Target Systems;” in U.S. Patent Application No. 62/182,796, filed Jun. 22, 2015 and entitled “Gauge Systems;” and in international PCT Patent Application No. PCT/US2015/037022, filed Jun. 22, 2015 and entitled “Cooperative Distributed Control Of Target Systems,” each of which is hereby incorporated by reference in its entirety.

FIG. 2B continues the example of FIG. 2A, and provides additional details about the control state improvement feedback loop and corresponding operations of the control state manager component discussed with respect to FIG. 2A. FIG. 2B illustrates components that include control system 205 a and control state manager component 205 c of FIG. 2A—while other components of FIG. 2A are not illustrated (e.g., control state coordination manager component(s) 188, battery 205 b, FET amplifier actuator 205 e, sensors 205 d, etc.), such components may similarly be present and perform operations as discussed with respect to FIG. 2A and elsewhere herein. FIG. 2B further illustrates multiple domains 210 that each represents a set of possible control actions and the response trajectories of the battery 205 b, with different domains corresponding to different sets of state information for control system actuator 205 e (e.g., different amounts of impedance or resistance provided by the actuator, different amounts of time that one or more impedances or resistances are provided, etc.), and with the control state manager component using the described techniques to automatically propagate changes in at least state and momentum that move the battery system being controlled (including the actuator 205 e) to different domains over time.

As previously noted, the battery 205 b may be modeled with a Hamiltonian function that includes operational constraints, and the control state manager component 205 c applies described propagation techniques to determine a domain in which the constraints are satisfied and sensor information from the battery (e.g., voltage and current) is compatible with the operational constraints. The control state manager component further performs the described techniques to improve functionality of the control system 205 a by applying a descent algorithm to reduce dissipation and move to a new domain that is closer to an idealized domain having non-dissipation battery operations (also referred to at times herein as a “paradise set”). In at least some embodiments and situations, the idealized domain may never be reached, but the control state manager component nevertheless improves functionality of the control system by reducing the amount of energy that is dissipated from the battery being controlled by the control system. Thus, rules for a control system agent may be used to define constraints for a data Hamiltonian for the agent, and converted to a constraint optimization problem that a corresponding CDD system solves, with the control state manager component improving control system functionality during use in a non-optimization manner without any defined criteria to optimize by instead repeatedly reducing differences between a current and idealized domain of control actions and their responses.

The control state manager component performs automated operations in at least some embodiments to, for a constrained Hamiltonian manifold representing a domain of possible response trajectories to control actions and labeled by a control action that defines how to deform the constrained manifold, propagate the manifold (and its associated domain) so that it approaches an idealized manifold (with an associated idealized domain) defined by a desired Hamiltonian. This control action includes the commands to the battery being controlled by the control system agent, as well as the status of the device (e.g., as measured with relation to a standardized time, such as a world clock time). The control state manager component generates state and momentum trajectories and manifold deformation control actions, and in at least some embodiments provides an implementation of a programmable descent algorithm (e.g., a version of Hamilton Jacobi equations coupled with a descent control propagator, optionally addressing a variational problem and using a Riemann descent schema), attempting to drive the controlled system towards an operational region defined by the idealized behavior rules encoded in a Hamiltonian manifold (e.g., an idealized manifold defined by rules that characterize best operation in some pre-defined set of rules)—thus, for a data Hamiltonian with state, momentum and control vectors, the control state manager component may find a time sequence of “descent paths” for the control system agent to move as close as possible to the idealized domain.

As previously noted, the battery model may be encoded by a constrained Data Hamiltonian that captures the behavior and dynamic rules for an associated control system agent, such as with the Lagrangian of each control system agent is being constructed according to energy conservation, and the data Hamiltonian being derived from the Lagrangian using a Legendre transformation, and hard rules added to the data Hamiltonian according to Paul Dirac's theorem of constrained Hamiltonians. The automated techniques of the control state manager component then allow the computation of trajectories that satisfy the constraints, approximate optimality condition given by Lagrangian, and generate a control law that drives the system manifold under control close to the idealized domain, as shown in FIG. 2B. Thus, the control system 205 a may perform one or more control actions 215 in the initial domain 210 a, such as control actions 215 a and 215 b at times To and Ti, respectively, resulting in corresponding battery operation trajectories 220 such as 220 a and 220 b, respectively. The control system manager component 205 c may use the described techniques to determine and implement various modifications or other adjustments 225 to the state of the control system actuator that result in corresponding domain changes, such as modification 225 a (using its indicated algorithm, as described further below) to move the battery operations from domain H₁ 210 a to a next domain H₂ 210 b having lower power dissipation. Other similar control actions 215 c, battery operation trajectories 220 c, actuator state modifications 225 b and other domains 210 c are similarly illustrated. As previously noted, while the operations repeatedly reduce the distance to idealized domain H_(D) 212, in at least some embodiments and situations, a final modification 227 (using its indicated algorithm, as described further below) to reach the idealized domain may not be possible. Furthermore, even if a lower domain is reached that has lower power dissipation based on the automated operations of the control state manager component, other changes in the system being controlled (e.g., with respect to internal state of the battery, such as chemistry or temperature; with respect to an electrical load served by the battery and/or electrical source supplying the battery; etc.) may cause other changes that move the system operations back to a higher domain with higher power dissipation (not shown)—if so, the control state manager component may similarly continue to perform further actuator state modifications to again move the system operations to lower domains. In at least some embodiments, the control state manager component may be executed in real-time with feedback of passive sensory data and a specifically designed sliding window, providing an open loop feedback system (also called a predictive control system), as discussed further below.

To provide various example details of how one embodiment of the control system manager component's automated techniques may be performed, and given a particular desired behavior for determining how to propagate values to move to a lower domain (also referred to as implementing a control law) for an initial Hamiltonian H(q, p, u) and an idealized Hamiltonian H_(D)(q_(p), p_(p)), desired behavior of the CDI control state manager component model may be represented as minimizing the distance between H and H_(D), i.e.,

$\begin{matrix} {\min\frac{1}{2}\left( {{H\left( {q,p,u} \right)} - {H_{D}\left( {q_{D},p_{D}} \right)}} \right)^{2}} & (1) \end{matrix}$ where u is a control vector, q and p are state and momentum vectors regarding to the Hamiltonian H, and q and p satisfy the Hamilton Jacobi equations as follows:

$\overset{.}{q} = \frac{\partial H}{\partial p}$ $\overset{.}{p} = {- \frac{\partial H}{\partial q}}$ with q_(p) and p_(p) being state and momentum vectors regarding the idealized Hamiltonian H_(D) and satisfying the further Hamilton Jacobi equations as follows:

${\overset{.}{q}}_{D} = \frac{\partial H_{D}}{\partial p_{D}}$ ${\overset{.}{p}}_{D} = {- \frac{\partial H_{D}}{\partial q_{D}}}$ H_(D) encodes the idealized paradise set P_(s), which satisfy the following conditions: as time t→∞, let (q(t),p(t))|_(t→∞) and u(t)|_(t→∞) be corresponding to the Hamiltonian=lim_(t→∞) H(q(t),p(t),u(t), if (q(t),p(t))|_(t→∞) ∈P _(s), then {dot over (u)}(t)_(t→∞)=0  (1) if (q _(D)(0),p _(D)(0))∈P _(s), then for sufficiently small t>0,(q _(D)(t),p _(D)(t))∈P _(s)  (2) The automated techniques operate to find one or more control signal(s) that give a time sequence of “descent path” for propagating a constrained Hamiltonian manifold as close as possible to the paradise set. In addition, these conditions indicate that if the controlled system's state is in the paradise set, no control is necessary to generate trajectories, as only the initial condition of the state is used —however, if external effects change the paradise set, the control law would be reactivated to drive the system to the new paradise set. The particular desired behavior for determining how to propagate values to move to a lower domain (also referred to as implementing a control law) may be automatically extracted from behavior rules of the target system being controlled in some embodiments, although in other embodiments the control law may instead be manually defined by an operator of the control system and/or a CDD system that creates the control system.

A Hamiltonian model of an electrical network can be expressed with two parts, in which only one part depends on the control vector u, per Tellegen's theorem, and the control vector in the Hamiltonian has the following form: H(q,p,u)=)H ⁽⁰⁾(q,p)+Σ_(j=1) ^(m)(H _(j) ⁽¹⁾)(q,p)·u _(j)) where m is the dimension of the control vector u. Desired behavior regarding such two-parts Hamiltonian can be expressed as the following:

$\begin{matrix} {\min{\frac{1}{2}\left\lbrack {{H^{(0)}\left( {q,p} \right)} + {\sum\limits_{j = 1}^{m}\left( {{H_{j}^{(1)}\left( {q,p} \right)} \cdot u_{j}} \right)} - {H_{D}\left( {q_{D},p_{D}} \right)}} \right\rbrack}^{2}} & (2) \end{matrix}$ To derive the control state manager component, simplify the notation by using C(H(q,p,u),H_(D)(q_(D),p_(D))) to represent the desired behavior, i.e.

${C\left( {{H\left( {q,p,u} \right)},{H_{D}\left( {q_{D},p_{D}} \right)}} \right)} = {\frac{1}{2}\left\lbrack {{H^{(0)}\left( {q,p} \right)} + {\sum\limits_{j = 1}^{m}\left( {{H_{j}^{(1)}\left( {q,p} \right)} \cdot u_{j}} \right)} - {H_{D}\left( {q,p} \right)}} \right\rbrack}^{2}$ Then descend the desired behavior C(H(q,p,u),H_(D)(q_(D),p_(D))) as follows. If

$\overset{.}{u} = {{{- \Gamma} \cdot \frac{\partial}{\partial u}}\left( \frac{{{dC}}_{u}}{dt} \right)}$ then lim_(t→∞) {dot over (u)}(t)→0 lim_(t→∞) C(H,H _(D))→ϵ where {dot over (u)}=du/dt and Γ is a positive scalar which can be viewed as step size, and

$\frac{{{dC}}_{u}}{dt}$ is the derivative over time t with a fixed value of u. The condition lim_(t→∞)C(H,H_(D))→ϵ implies that, given

${\overset{.}{u} = {{{- \Gamma} \cdot \frac{\partial}{\partial u}}\left( \frac{{{dC}}_{u}}{dt} \right)}},$ as time goes to infinity, the Hamiltonian manifold may not reach the paradise set, but can guarantee that it reaches a region which is € away from the paradise set.

To show how to apply the descent path given above to propagate a Hamiltonian manifold, labeled by a control action that defines how to deform the constrained manifold, so that it approaches an ideal idealized manifold defined by an idealized Hamiltonian, consider the following. Given the current implemented control u(t₀), and the state and momentum at current time t₀ (i.e., q(t₀) and p(t₀)), dynamics for propagating q and p from Hamilton Jacobi equations are as follows, with control vector u fixed as u(t₀):

$\begin{matrix} {{\overset{.}{q}}_{u{({t\; 0})}} = \frac{\left. {{{{\partial{H\left( q \right.}_{u{({t\; 0})}}},p}}_{u{(t_{0})}},{u\left( t_{0} \right)}} \right)}{{\partial p}❘_{u{({t\; 0})}}}} & (3) \\ {{\overset{.}{p}}_{u{({t\; 0})}} = {- \frac{\left. {{{{\partial{H\left( q \right.}_{u{(t_{0})}}},p}}_{u{({t\; 0})}},{u\left( t_{0} \right)}} \right)}{{{\partial q}}_{u{({t\; 0})}}}}} & (4) \end{matrix}$ where q|_(u(t0)), P|_(u(t0)) denote the propagated state and momentum with fixed u with the value u(t₀), and {dot over (q)}|_(u(t0)), {dot over (p)}|_(u(t0)) are the corresponding changing rates of q|_(u(t0)), p|_(u(t0)). Consider the desired behavior C given by equation (2). According to the results above, in order to get {dot over (u)}, first get derivative of the desired behavior C over time t with control vector u to be fixed as u(t₀), i.e.

$\left. {\left. {\left. {\left. {{\frac{{{dC}}_{u{(t_{0})}}}{dt} = \left\lbrack {{H\left( q \right.}_{u{(t_{0})}},p} \right._{u{(t_{0})}}},{u(t)}} \right) - {H_{D}\left( {q_{D},p_{D}} \right)}} \right\rbrack \cdot \left\lbrack \ {\left( {\frac{\left. {{{{\partial{H\left( q \right.}_{u{(t_{0})}}},p}}_{u{(t_{0})}},{u(t)}} \right)}{{{\partial q}}_{u{(t_{0})}}} \cdot \overset{.}{q}} \right._{u{(t_{0})}} + {\frac{\left. {{{{\partial{H\left( q \right.}_{u{(t_{0})}}},p}}_{u{(t_{0})}},{u(t)}} \right)}{{{\partial p}}_{u{(t_{0})}}} \cdot \overset{.}{p}}} \right._{u{(t_{0})}}} \right) - \left( {{\frac{\partial H_{D}}{\partial q_{D}}{\overset{.}{q}}_{D}} + {\frac{\partial H_{D}}{\partial p_{D}}{\overset{.}{p}}_{D}}} \right)} \right\rbrack$ with q|_(u(t0)), p|_(u(t0)), {dot over (q)}|_(u(t0)), {dot over (p)}|_(u(t0)) provided by propagating Hamilton Jacobi equations of H(q,p,u) with control vector u to be fixed as u(t₀). Replacing {dot over (q)}_(D), {dot over (p)}_(D) appeared in the term

$\left( {{\frac{\partial H_{D}}{\partial q_{D}}{\overset{.}{q}}_{D}} + {\frac{\partial H_{D}}{\partial p_{D}}{\overset{.}{p}}_{D}}} \right)$ of

$\frac{{{dC}}_{u{(t_{0})}}}{dt}$ equation by Hamilton Jacobi equations of the idealized Hamiltonian H_(D)(q_(D), p_(D)) gives

${{\frac{\partial H_{D}}{\partial q_{D}}{\overset{.}{q}}_{D}} + {\frac{\partial H_{D}}{\partial p_{D}}{\overset{.}{p}}_{D}}} = {{{\frac{\partial H_{D}}{\partial q_{D}} \cdot \frac{\partial H_{D}}{\partial p_{D}}} - {\frac{\partial H_{D}}{\partial p_{D}} \cdot \frac{\partial H_{D}}{\partial q_{D}}}} = 0}$ Therefor the term

$\left( {{\frac{\partial H_{D}}{\partial q_{D}}{\overset{.}{q}}_{D}} + {\frac{\partial H_{D}}{\partial p_{D}}{\overset{.}{p}}_{D}}} \right)$ can be removed from

$\frac{\left. {dC} \right|_{u{(t_{0})}}}{dt}$ equation.

$0 = {{{\frac{\partial H_{D}}{\partial q_{D}}{\overset{.}{q}}_{D}} + {\frac{\partial H_{D}}{\partial p_{D}}{\overset{.}{p}}_{D}}} = \frac{dH_{D}}{dt}}$ implies H_(D) is a constant over time, and therefore H_(D) can be evaluated with q_(D)(t₀) and p_(D)(t₀). Removing the term

$\left( {{\frac{\partial H_{D}}{\partial q_{D}}{\overset{.}{q}}_{D}} + {\frac{\partial H_{D}}{\partial p_{D}}{\overset{.}{p}}_{D}}} \right)$ from

$\frac{\left. {dC} \right|_{u{(t_{0})}}}{dt}$ gives

$\frac{\left. {dC} \right|_{u{(t_{0})}}}{dt} = {\left\lbrack {{H\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}},{u(t)}} \right)} - {H_{D}\left( {{q_{D}\left( t_{0} \right)},{p_{D}\left( t_{0} \right)}} \right)}} \right\rbrack \cdot {\quad\left\lbrack \ \left( {\frac{\partial{H\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}},{u(t)}} \right)}}{\left. {\partial q} \right|_{u{(t_{0})}}}\  \cdot \overset{.}{q}} \middle| {}_{u{(t_{0})}}{+ \left. \quad\left. {\frac{\partial{H\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}},{u(t)}} \right)}}{\left. {\partial p} \right|_{u{(t_{0})}}}\ .\ \overset{.}{p}} \right|_{u{(t_{0})}} \right)} \right\rbrack \right.}}$ Next, take partial derivative of

$\frac{\left. {dC} \right|_{u{(t_{0})}}}{dt}$ over the control vector u, let u_(j) be the j^(th) element of the u vector, and derive

$\frac{\partial}{\partial u_{j}}\left( \frac{\left. {dC} \right|_{u{(t_{0})}}}{dt} \right)$ for j=1, 2, . . . , m as follows:

${\frac{\partial}{\partial u_{j}}\left( \frac{\left. {dC} \right|_{u{(t_{0})}}}{dt} \right)} = {\frac{\partial{H\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}},{u(t)}} \right)}}{\partial u_{j}} \cdot {\quad{\left\lbrack \left. {\frac{\partial{H\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}},{u(t)}} \right)}}{\left. {\partial q} \right|_{u{(t_{0})}}} \cdot \overset{.}{q}} \middle| {}_{u{(t_{0})}}{{+ \frac{\partial{H\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}},{u(t)}} \right)}}{\left. {\partial p} \right|_{u{(t_{0})}}}} \cdot \overset{.}{p}} \right|_{u{(t_{0})}} \right\rbrack + {\quad{\left\lbrack {{H\left( {\left. q \right|_{u{({t\; 0})}},\left. p \right|_{u{(t_{0})}},{u(t)}} \right)} - {H_{D}\left( {{q_{D}\left( t_{0} \right)},{p_{D}\left( t_{0} \right)}} \right)}} \right\rbrack \cdot {\quad{{\left\lbrack \left. {\frac{\partial}{\partial u_{j}}{\left( \frac{\partial{H\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}},{u(t)}} \right)}}{\left. {\partial q} \right|_{u{(t_{0})}}} \right)\  \cdot \ \overset{.}{q}}} \middle| {}_{u{(t_{0})}}{{+ \frac{\partial}{\partial u_{j}}}{\left( \frac{\partial{H\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}},{u(t)}} \right)}}{\left. {\partial p} \right|_{u{(t_{0})}}} \right)\  \cdot \ \overset{.}{p}}} \right|_{u{(t_{0})}} \right\rbrack\mspace{20mu}{And}{H\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}},{u(t)}} \right)}} = {{{H^{(0)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)} + {\sum\limits_{k = 1}^{m}{\left( {{H_{k}^{(1)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)} \cdot {u_{k}(t)}} \right)\mspace{20mu}\frac{\partial{H\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}},{u(t)}} \right)}}{\partial u_{j}}}}} = {{{H_{j}^{(1)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)}\frac{\partial{H\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}},{u(t)}} \right)}}{\left. {\partial q} \right|_{u{(t_{0})}}}} = {{\frac{\partial{H^{(0)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)}}{\left. {\partial q} \right|_{u{(t_{0})}}} + {\sum\limits_{k = 1}^{m}{\left( {\frac{\partial{H_{k}^{(1)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)}}{\left. {\partial q} \right|_{u{(t_{0})}}} \cdot {u_{k}(t)}} \right)\frac{\partial{H\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}},{u(t)}} \right)}}{\left. {\partial p} \right|_{u{(t_{0})}}}}}} = {{\frac{\partial{H^{(0)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)}}{\left. {\partial p} \right|_{u{(t_{0})}}} + {\sum\limits_{k = 1}^{m}{\left( {\frac{\partial{H_{k}^{(1)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)}}{\left. {\partial p} \right|_{u{(t_{0})}}} \cdot {u_{k}(t)}} \right)\mspace{20mu}\ldots\frac{\partial}{\partial u_{j}}\left( \frac{\partial{H\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}},{u(t)}} \right)}}{\left. {\partial q} \right|_{u{(t_{0})}}} \right)}}} = {{\frac{\partial{H_{j}^{(1)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)}}{\left. {\partial q} \right|_{u{(t_{0})}}}\mspace{20mu}\frac{\partial}{\partial u_{j}}\left( \frac{\partial{H\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}},{u(t)}} \right)}}{\left. {\partial p} \right|_{u{(t_{0})}}} \right)} = \frac{\partial{H_{j}^{(1)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)}}{\left. {\partial p} \right|_{u{(t_{0})}}}}}}}}}}}}}}}$ results in

${\frac{\partial}{\partial u_{j}}\left( \frac{{d\; C}❘_{u{(t_{0})}}}{d\; t} \right)} = {{{H_{j}^{(1)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)} \cdot \left. \quad\left. {\left\lbrack \left( {\frac{\partial{H^{(0)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)}}{\left. {\partial q} \right|_{u{(t_{0})}}} + {\sum\limits_{k = 1}^{m}{\left( \frac{\partial{H_{k}^{(1)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)}}{\left. {\partial q} \right|_{u{(t_{0})}}} \right) \cdot {u_{k}(t)}}}} \right) \right) \cdot \left. \quad\left. \overset{.}{q} \middle| {}_{u{(t_{0})}}{+ \left( {\frac{\partial{H^{(0)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)}}{\left. {\partial p} \right|_{u{(t_{0})}}} + {\sum\limits_{k = 1}^{m}{\left( \frac{\partial{H_{k}^{(1)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)}}{\left. {\partial p} \right|_{u{(t_{0})}}} \right) \cdot {u_{k}(t)}}}} \right)} \right. \right) \cdot \overset{.}{p}} \right|_{u{(t_{0})}} \right\rbrack} + {\quad\left\lbrack {{H^{(0)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)} + {\sum\limits_{k = 1}^{m}\left( {{H_{k}^{(1)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)} \cdot {u_{k}(t)}} \right)} - {\left. \quad{H_{D}\left( {{q_{D}\left( t_{0} \right)},{p_{D}\left( t_{0} \right)}} \right)} \right\rbrack \cdot {\quad\left\lbrack \left. {\frac{\partial{H_{j}^{(1)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)}}{\left. {\partial q} \right|_{u{(t_{0})}}} \cdot \overset{.}{q}} \middle| {}_{u{(t_{0})}}{{+ \frac{\partial{H_{j}^{(1)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)}}{\left. {\partial p} \right|_{u{(t_{0})}}}} \cdot \overset{.}{p}} \right|_{u{(t_{0})}} \right\rbrack}}} \right.}}$ By grouping the terms with u and the terms without u, the

$\frac{\partial}{\partial u_{j}}\left( \frac{\left. {dC} \right|_{u{(t_{0})}}}{dt} \right)$ equation can be written as

$\left. {{\frac{\partial}{\partial u_{j}}\left( \frac{\left. {dC} \middle| {}_{u{(t)}}0 \right.}{dt} \right)} = {{\alpha_{j}\left( {\left. H \right|_{u{({t0})}},\ \left. H_{D} \right|_{t_{0}}} \right)} + {\sum\limits_{k = 1}^{m}{\beta_{jk}\left( {\left. H \right|_{u{({t0})}},\ \left. H_{D} \right|_{t_{0}}} \right)}}}} \right) \cdot u_{k}$ where

${\alpha_{j}\left( \left. H \middle| {}_{u{({t\; 0})}}{\cdot H_{D}} \right|_{t_{0}} \right)} = {{{H_{j}^{(1)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)} \cdot \left( \left. {\frac{\partial{H^{(0)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)}}{\left. {\partial q} \right|_{u{(t_{0})}}}\  \cdot \overset{.}{q}} \middle| {}_{u{(t_{0})}}{+ {\frac{\partial{H^{(0)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)}}{\left. {\partial p} \right|_{u{(t_{0})}}}\ .\ \overset{.}{p}}} \right|_{u{(t_{0})}} \right)} + {\left( {{H^{(0)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)} - {H_{D}\left( {{q_{D}\left( t_{0} \right)},{p_{D}\left( t_{0} \right)}} \right)}} \right) \cdot \left( \left. {\frac{\partial{H_{j}^{(1)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)}}{\left. {\partial q} \right|_{u{(t_{0})}}}\  \cdot \overset{.}{q}} \middle| {}_{u{(t_{0})}}{{+ \frac{\partial{H_{j}^{(1)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)}}{\left. {\partial p} \right|_{u{(t_{0})}}}}\  \cdot \ \overset{.}{p}} \right|_{u{(t_{0})}} \right)}}$ ${\beta_{jk}\left( {\left. H \right|_{u{({t0})}},\ \left. H_{D} \right|_{t_{0}}} \right)} = {{H_{j}^{(1)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)} \cdot \left\lbrack {\frac{\partial{H_{k}^{(1)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)}}{\left. {\partial q} \right|_{u{(t_{0})}}}\  \cdot \overset{.}{q}} \middle| {}_{u{(t_{0})}}{{+ \left. \quad\left. {\frac{\partial{H_{k}^{(1)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)}}{\left. {\partial p} \right|_{u{(t_{0})}}}\  \cdot \overset{.}{p}} \right|_{u{(t_{0})}} \right\rbrack} + {{H_{k}^{(1)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)} \cdot \left\lbrack \left. {\frac{\partial{H_{j}^{(1)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)}}{\left. {\partial q} \right|_{u{(t_{0})}}} \cdot \overset{.}{q}} \middle| {}_{u{(t_{0})}}{{+ \frac{\partial{H_{j}^{(1)}\left( {\left. q \right|_{u{(t_{0})}},\left. p \right|_{u{(t_{0})}}} \right)}}{\left. {\partial p} \right|_{u{(t_{0})}}}}\  \cdot \ \overset{.}{p}} \right|_{u{(t_{0})}} \right\rbrack}} \right.}$ Therefore, the dynamics for propagating the control vector, i.e.

${\overset{.}{u} = {{{- \Gamma} \cdot \frac{\partial}{\partial u}}\left( \frac{\left. {dC} \right|_{u}}{dt} \right)}},$ is given by {dot over (u)}=−Γ·[α_(j)(H| _(u(t0)) ,H _(D)|_(t) ₀ )+Σ_(k=1) ^(m)β_(jk)(H| _(u(t0)) ,H _(D)|_(t) ₀ )·u _(k)]  (5) This equation is a Reimann descent model, and equations (3), (4) and (5) can be solved numerically using a numerical propagator, for use by the control state manager component in implementing the described techniques in at least some embodiments.

In many target systems, the state is constrained by operational requirements, limitations of the domain and other reasons, which are described by hard rules in models of those target systems. The hard rules can be used construct a constraint Hamiltonian using Dirac theory, in which the Lagrangian of each CDI control system agent is constructed according to energy conservation, the data Hamiltonian is derived from the Lagrangian using the Legendre transformation such that the momentum vector p(t) appeared in the data Hamiltonian has the following relationship with the Lagrangian that is denoted by L(q(t), {dot over (q)}(t), u(t)), where q(t) is state vector, {dot over (q)}(t) is changing rate of q(t), and u(t) is control vector as follows:

${p(t)} = \frac{\partial{L\left( {{q(t)},{\overset{.}{q}(t)},{u(t)}} \right)}}{\partial{\overset{.}{q}(t)}}$ System constraints are incorporated into the Hamiltonian using state dependent multipliers, as described below. To construct a constrained Hamiltonian using hard rules, also referred to as a Total Hamiltonian and denoted by H_(T), and given the unconstrained Hamiltonian H(q,p,u)=H ⁽⁰⁾(q,p)+Σ_(j=1) ^(m) H _(j) ⁽¹⁾(q,p)·u _(j) let ϕ_(i)(q, p)=0 for i=1, 2, . . . , I be hard rules associated with the state q vector and momentum p, where ϕi's are independent functions. The total data Hamiltonian is given as H _(T)(q,p,u)=H ⁽⁰⁾(q,p)+Σ_(j=1) ^(m) H _(j) ⁽¹⁾(q,p)·u _(j)+Σ_(i=1) ^(I)λ_(i)ϕ_(i)(q,p) with constraint Mλ+V=0 where

$V = \begin{bmatrix} {\left\{ {\phi_{1},H^{(0)}} \right\} + {\sum\limits_{j = 1}^{m}{\left\{ {\phi_{1},H_{j}^{(1)}} \right\} \cdot u_{j}}}} \\ {\left\{ {\phi_{2},H^{(0)}} \right\} + {\sum\limits_{j = 1}^{m}{\left\{ {\phi_{2},H_{j}^{(1)}} \right\} \cdot u_{j}}}} \\ \vdots \\ {\left\{ {\phi_{I},H^{(0)}} \right\} + {\sum\limits_{j = 1}^{m}{\left\{ {\phi_{i},H_{j}^{(1)}} \right\} \cdot u_{j}}}} \end{bmatrix}$ $M = \begin{bmatrix} \left\{ {\phi_{1},\phi_{1}} \right\} & \left\{ {\phi_{1},\phi_{2}} \right\} & \left\{ {\phi_{1},\phi_{3}} \right\} & \ldots & \left\{ {\phi_{1},\phi_{I}} \right\} \\ \left\{ {\phi_{2},\phi_{1}} \right\} & \left\{ {\phi_{2},\phi_{2}} \right\} & \left\{ {\phi_{2},\phi_{3}} \right\} & \ldots & \left\{ {\phi_{2},\phi_{I}} \right\} \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ \left\{ {\phi_{I},\phi_{1}} \right\} & \left\{ {\phi_{I},\phi_{2}} \right\} & \left\{ {\phi_{I},\phi_{3}} \right\} & \ldots & \left\{ {\phi_{I},\phi_{I}} \right\} \end{bmatrix}$ $\lambda = \begin{bmatrix} \lambda_{1} \\ \lambda_{2} \\ \vdots \\ \lambda_{I} \end{bmatrix}$ The constraint M+V=0 is derived from Poisson bracket, {ϕ_(i) ,H _(T)}={ϕ_(i) ,H ⁽⁰⁾}+Σ_(j=1) ^(m){ϕ_(i) ,H _(j) ⁽¹⁾ }·u _(j)+Σ_(l=1) ^(I)λ_(l){ϕ_(i),ϕ_(l)} for all i=1, . . . , I, which allows the hard rules to define a feasible manifold, and is sometimes referred to as Dirac Compatibility condition. If ϕ_(i)'s are independent functions then the Poisson bracket matrix M is invertible. The constrained Hamiltonian H_(T)(q, p, u) satisfies the following Hamilton-Jacobi equations as long as the state and momentum moving along the surface defined by the hard rules ϕ_(i)(q, p)=0 for i=1, 2, . . . , I

$\overset{.}{q} = {\frac{\partial H_{T}}{\partial p} = {{\frac{\partial H^{(0)}}{\partial p} + {\sum\limits_{j = 1}^{m}{\frac{\partial H_{j}^{(1)}}{\partial p} \cdot u_{j}}} + {\sum\limits_{i = 1}^{I}{\lambda_{i}\frac{\partial\phi_{i}}{\partial p}\overset{.}{p}}}} = {{- \frac{\partial H_{T}}{\partial q}} = {{- \frac{\partial H^{(0)}}{\partial q}} - {\sum\limits_{j = 1}^{m}{\frac{\partial H_{j}^{(1)}}{\partial q} \cdot u_{j}}} - {\sum\limits_{i = 1}^{I}{\lambda_{i}\frac{\partial\phi_{i}}{\partial q}}}}}}}$ The dynamics of control vector u is still derived by

${\overset{.}{u} = {{{- \Gamma} \cdot \frac{\partial}{\partial u}}\left( \frac{\left. {dC} \right|_{u}}{dt} \right)}},$ but here the idealized behavior function C is constructed from the constrained Hamiltonian H_(T)(q, p, u) as well as the idealized Hamiltonian H_(D)(q_(D), p_(D)).

In at least some embodiments, the propagating of state, control and momentum values is performed in the following manner. Let t₀ to be current world clock time, and let the time interval [t₀, t₀+Δ_(T)] be a defined window of future time for propagating state q, momentum p, and the control u, by the control state manager component. Let (2*K) be the total number of time points to be sampled over the time interval, and define the bucket time δ_(t) such that δ_(t)=Δ_(T)/(2*K), which corresponds to the sampling period of the propagated results. In such embodiments, steps for propagating state q, momentum p, and control u over the time interval [t₀, t₀+Δ_(T)] are as follows:

-   -   Given q(t₀), p(t₀), u(t₀), q_(D)(t₀) and p_(D)(t₀), evaluate         H_(D)|_(t0)=H_(D)(q_(D)(t₀), p_(D)(t₀)), and set current time         t_(c)=t₀     -   At time t_(c), given p(t_(c)), q(t_(c)) and u(t_(c)), compute λ         from equation −Mλ=V, where M, V are defined as above.     -   Propagate q(t) and p(t) over time interval [t_(c), t_(c)+δ_(t)]         by integrating the dynamics

$\overset{.}{q} = \frac{\partial H_{T}}{\partial p}$ and

$\overset{.}{p} = {- \frac{\partial H_{T}}{\partial q}}$ with u to be fixed as u(t_(c)), with λ given by step 2, and with initial condition q(t_(c)) and p(t_(c)).

-   -   Propagate u(t) over time interval [t_(c), t_(c)+δ_(t)] by         integrating the dynamics

${\overset{.}{u} = {{{- \Gamma} \cdot \frac{\partial}{\partial u}}\left( \frac{\left. {dC} \right|_{u}}{dt} \right)}},$ with q(t), p(t), {dot over (q)}(t), and {dot over (p)}(t) given by step 3 and λ given by step 2.

-   -   Move the time t_(c) forward by one bucket time, i.e.         t_(c)←t_(c)δ_(t)     -   If t_(c)≥t₀+ΔT, stop; otherwise, set

${{{p\left( t_{c} \right)} = \frac{\partial{L\left( {{q(t)},{\overset{.}{q}(t)},{u(t)}} \right)}}{\partial{\overset{.}{q}(t)}}}}_{t_{c}},$ return to step 2. For example, with respect to the battery 205 b and actuator 205 e, the propagated state information may provide a vector of state values indicating the desired state of the battery, which the actuator uses to guide the operation of the battery to correspond to, as close as possible, satisfying the load demand while maximizing longevity and tuning up the status of battery charge.

FIGS. 2C-2D continue the examples of FIGS. 2A-2B, and provide further details regarding examples of a control state manager component propagating current values for state, momentum and control for a current domain of control action responses over a defined time window toward an idealized domain. In at least some embodiments, the state, momentum and control propagated as described above are sampled and filtered by a triangle window filter to reduce aliasing effect of sampled signals, and approximate a Gaussian filter.

Let the time interval [t₀, t₀+Δ_(T)] be the window of future time for propagating the control u, state q and momentum p by the control state manager component, and let (2*K) be the total number of time points to be sampled over the time interval. Define the bucket time δ_(t) such that δ_(t)=Δ_(T)/(2*K), which corresponds to the sampling period of the propagated results. Let ω(τ) be the weight at sample time τ. For the triangle window filter, the weight is computed as follows:

${\omega\left( {t_{0} + {k \cdot \delta_{t}}} \right)} = \left\{ \begin{matrix} {\frac{k}{K},} & {{{{if}\mspace{14mu} k} = 0},1,\ldots\mspace{14mu},K} \\ {{2 - \frac{k}{K}},} & {{{{if}\mspace{14mu} k} = {K + 1}},\ldots\mspace{14mu},{2 \cdot K}} \end{matrix} \right.$ Information 200C of FIG. 2C graphically shows the relations between the bucket time and the weights of the triangle window filter.

Given the sampled propagation of control u, state q and momentum p over the time interval [t₀, t₀+Δ_(T)], and given the triangle window filter, the weighted average of the control, state and momentum are computed as follows

${\overset{¯}{u} = \frac{\sum\limits_{k = 1}^{2 \cdot K}{{\omega\left( {t_{0} + {k \cdot \delta_{t}}} \right)} \cdot {u\left( {t_{0} + {k \cdot \delta_{t}}} \right)}}}{\sum\limits_{k = 1}^{2 \cdot K}{\omega\left( {t_{0} + {k \cdot \delta_{t}}} \right)}}}{\overset{¯}{p} = \frac{\sum\limits_{k = 1}^{2 \cdot K}{{\omega\left( {t_{0} + {k \cdot \delta_{t}}} \right)} \cdot {p\left( {t_{0} + {k \cdot \delta_{t}}} \right)}}}{\sum\limits_{k = 1}^{2 \cdot K}{\omega\left( {t_{0} + {k \cdot \delta_{t}}} \right)}}}{\overset{¯}{q} = \frac{\sum\limits_{k = 1}^{2 \cdot K}{{\omega\left( {t_{0} + {k \cdot \delta_{t}}} \right)} \cdot {q\left( {t_{0} + {k \cdot \delta_{t}}} \right)}}}{\sum\limits_{k = 1}^{2 \cdot K}{\omega\left( {t_{0} + {k \cdot \delta_{t}}} \right)}}}$

In at least some embodiments, the control state manager component is continuously executed in real-time, and the triangle window filter is applied with a sliding window concept, as shown in FIG. 2D. At current time t₀, given the initial conditions of state q, momentum p and control u, values for q, p and u are propagated over the future time window [t₀, t₀+Δ_(T)], and the propagated signals are sampled according to the sampling period defined by the bucket time. The triangle window filter is applied over the future time window [t₀, t₀+Δ_(T)] and the weighted average values ū, p, and q are computed. These average values computed at current time t₀ provide the actions which will be implemented over the time interval [t₀+Δ_(T)/2, t₀+3Δ_(T)/2], which means the implementation of the actions is half window delayed. The reason for delay is due to causality. Once the time reaches t₀+Δ_(T)/2, the actions computed at time t₀ will start to be implemented for the length of a time window, until the middle of the next time window (i.e., until t₀+3ΔT/2). Meanwhile, when the time reaches the end of the window beginning at time t₀ (i.e., reaches t₀+Δ_(T)), the window slides from [t₀, t₀+Δ_(T)] to [t₀+Δ_(T), t₀+2Δ_(T)], and the procedure for generating the actions over the new window repeats. Notice that the sliding window parameter Δ_(T) determines how far the q, p and u values can be propagated, and is preferably chosen so that the error due to the delay of implementing the actions is less than O(Δ_(T)/2) and satisfies the Hurwitz stability condition (e.g., satisfies

${\frac{1}{\lambda_{\max}} > \frac{\Delta_{T}}{2}},$ where 1/λ_(max) is the smallest time constant), while being large enough that the control u approaches zero (i.e., u→ϵ as t→∞).

The propagation of state q, momentum p and control u uses initial conditions. Given the historical estimated state q and the control actions, as well as the observations measured by passive sensors, the initial condition of state vector q is estimated in at least some embodiments by a nonlinear Kalman Bucy filter. The propagated control vector at the end of previous window is used in at least some embodiments to provide the initial condition for control vector, and the initial condition of momentum vector is computed in at least some embodiments from the historical estimated state and the control using Dirac conditions. The nonlinear Kalman Bucy filter is not used in limited situations in which all of the states are observable and the measurement of the error is sufficiently small (e.g., below a defined threshold). However, if some states that are not observable, or the uncertainty of the measurement is not sufficiently small, then the Kalman filter may be used. For a battery, or an electrical network, the state will be observed directly, so a non-linear Kalman Filter may not be used.

To summarize details of the examples below, an overall procedure of the control state manager component working together with the triangle window filter the sliding window can be described as follows:

(1) at current time t₀, get the estimated state at time t₀ (i.e. {dot over (q)}(t₀)) from the output of nonlinear Kalman Bucy filter (or directly observer if all states are observable and the measurement of the error is sufficiently small); set initial condition of the control vector u(t₀) to be the current applied control;

(2) set q(t₀)={circumflex over (q)}(t₀), q_(D)(t₀)={circumflex over (q)}(t₀); compute initial condition of momentum p(t₀) and idealized momentum p_(D)(t₀) according to Dirac conditions;

(3) given the time window [t₀, t₀+Δ_(T)] and the integer K, setup bucket time δ_(t)=Δ_(T)/(2*K);

(4) given the initial conditions q(t₀), p(t₀), u(t₀), q_(D)(t₀) and p_(D)(t₀), propagate q, p and u over the window by applying the procedure of propagating state, momentum and control described above, sample the propagated results p(τ), q(τ) and u(τ) at each sampling time τ=t₀ k*δ_(t) for k=1, 2, . . . , 2*K, and save for future usage;

(5) compute weighted average values ū, q, and p according to equations discussed above;

(6) wait until time t₀+Δ_(T)/2, and output ū, q, and p as the actions for the future time interval [t₀+Δ_(T)/2, t₀+3Δ_(T)/2]; save for possible use with mean field; and

(7) slide the time window to [t₀+Δ_(T), t₀+2Δ_(T)]; wait until time t₀+2Δ_(T) and update current time variable accordingly; and return to (1).

These details provide a procedure for one example embodiment of propagating control state improvement information for a decision module (or ‘agent’), as follows:

(A) Start with inputs that include the following:

-   -   start time t₀; window length Δ_(T); number of points K to be         sampled in half window; CDI bucket time δ_(t) (note:         δ_(t)=Δ_(T)/(2*K)); number of integration steps n_(st) within         δ_(t) time segment     -   (^(10*)) initial conditions: q(t₀), {dot over (q)}(t₀),         q_(D)(t₀), p_(D)(t₀); control vector at t₀: u(t₀)=[U₁(t₀),         u₂(t₀), . . . , U_(m)(t₀)]^(T)     -   (^(11*)) polynomial equations: H_(D)(q_(D)(t₀),p_(D)(t₀)),         δ_(L)(q,{dot over (q)},u)/δ_({dot over (q)}), H_(nou)(q,p),         δH_(nou)(q,p)/δq, δH_(nou)(q,p)/δp, H_(uj)(q,p),         δH_(uj)(q,p)/δq, δH_(uj)(q,p)/δp, for j=1, 2, . . . , m and         parameter Γ         ^(10*)—control u is a m×1 vector, state q is a n×1 vector, where         m<n         ^(11*)—L_(D)(q_(D),{dot over (q)}_(D)) is a desired Lagrangian,         H_(D)(q_(D),p_(D)) is its corresponding desired Hamiltonian;         L(q,{dot over (q)},u) is a Lagrangian with control variable, and         its corresponding Hamiltonian with control variable is         H(q,p,u)=H _(nou)(q,p)+Σ_(j=1) ^(m) H _(uj)(q,p)*u _(j)         CDI agent criterion: C(H(q,p,u),H_(D)(q_(D),p_(D))) is the         criterion measuring the performance differences between the         Hamiltonian H(q,p,u) and the desired Hamiltonian H_(D). Define         C(H(q,p,u),H_(D)(q_(D),p_(D)))=½*H(q,p,u), H_(D)(q_(D),p_(D)))²         (B) Evaluate Desired Hamiltonian         H_(D)|t₀=H_(D)(q_(D)(t₀),p_(D)(t₀)),         (C) Evaluate Momentum         p(t₀)=(δL(q,{dot over (q)},u)/δ_({dot over (q)}))|t₀         H_(D)|t₀=H_(D)(q_(D)(t₀),p_(D)(t₀)),         (D) Set τ←t₀         (E) Numerical Propagation—For the time window [τ, τ+δ_(t)],         apply numerical integration method (e.g. Runge-Kutta method) to         propagate the dynamics of q, p, and u:         (E1)—Set t_(start)←T         (E2)—For the time window [t_(start), t_(start)+δ_(t)/n_(st)],         propagate q, p with constant u:

${\overset{.}{q} = {\frac{\partial{H_{nou}\left( {q,p} \right)}}{\partial p} + {\sum\limits_{j = 1}^{m}{\frac{\partial{H_{uj}\left( {q,p} \right)}}{\partial p} \cdot {u_{j}\left( t_{start} \right)}}}}},{\overset{.}{p} = {{- \frac{\partial{H_{nou}\left( {q,p} \right)}}{\partial p}} - {\sum\limits_{j = 1}^{m}{\frac{\partial{H_{uj}\left( {q,p} \right)}}{\partial p} \cdot {u_{j}\left( t_{start} \right)}}}}}$ with initial conditions q (t_(start)), p (t_(start)) (E3)—Set t_(start)←t_(start)+δ_(t)/n_(st) (E4)—t_(start)=τ+δ_(t)? If no, return to (E2), and otherwise set t_(start)←T. (E5)—For the time window [t_(start), t_(start)+δ_(t)/n_(st)], propagate u_(j) for j=1, 2, . . . , m simultaneously with q,p,{dot over (q)}, {dot over (p)} to be fixed values at t_(start) and with initial conditions u_(j)(t_(start)):

$\left. {\frac{{du}_{j}(t)}{dt} = {{- \Gamma}\frac{\partial}{\partial u_{j}}\left( \frac{dC}{dt} \right._{{fixed}\mspace{14mu} u}}} \right) = {{- \Gamma} \cdot \left( {{\alpha_{j}\left( t_{start} \right)} + {\sum\limits_{k = 1}^{m}{{\beta_{jk}\left( t_{start} \right)} \cdot {u_{k}(t)}}}} \right)}$   where ${\beta_{jk}\left( t_{start} \right)} = {{\left( {{H_{uj} \cdot \left( {{\frac{\partial H_{uk}}{\partial q} \cdot \overset{.}{q}} + {\frac{\partial H_{uk}}{\partial p} \cdot \overset{.}{p}}} \right)} + {H_{uk} \cdot \left( {{\frac{\partial H_{uj}}{\partial q} \cdot \overset{.}{q}} + {\frac{\partial H_{uj}}{\partial p} \cdot \overset{.}{p}}} \right)}} \right)❘_{t\_ start}{\alpha_{j}\left( t_{start} \right)}} = {\left. \left( {{H_{uj} \cdot \left( {{\frac{\partial H_{nou}}{\partial q} \cdot \overset{.}{q}} + {\frac{\partial H_{nou}}{\partial p} \cdot \overset{.}{p}}} \right)} + {\left( \left. {H_{nou} - H_{D}} \right|_{t_{0}} \right)\left( {{\frac{\partial H_{uj}}{\partial q} \cdot \overset{.}{q}} + {\frac{\partial H_{uj}}{\partial p} \cdot \overset{.}{p}}} \right)}} \right) \middle| {}_{t\_ start}{\beta_{l\_ jk}\left( t_{start} \right)} \right. = {\left. \left( {{H_{{l\_ u}j}^{(i)} \cdot \left( {{\frac{\partial H_{l\_ uk}^{(i)}}{\partial q_{s}^{(i)}} \cdot {\overset{.}{q}}_{s}^{(i)}} + {\frac{\partial H_{l\_ uk}^{(i)}}{\partial p_{l}^{(i)}} \cdot {\overset{.}{p}}_{l}^{(i)}}} \right)} + {H_{l\_ uk}^{(i)} \cdot \left( {{\frac{\partial H_{{l\_ u}j}^{(i)}}{\partial q_{s}^{(i)}} \cdot {\overset{.}{q}}_{s}^{(i)}} + {\frac{\partial H_{{l\_ u}j}^{(i)}}{\partial p_{l}^{(i)}} \cdot {\overset{.}{p}}_{l}^{(i)}}} \right)}} \right) \middle| {}_{t\_ start}{\alpha_{l\_ j}\left( t_{start} \right)} \right. = {\left. \left( {{H_{{l\_ u}j}^{(i)} \cdot \left( {{\frac{\partial H_{l\_ nou}^{(i)}}{\partial q_{s}^{(i)}} \cdot {\overset{.}{q}}_{s}^{(i)}} + {\frac{\partial H_{{l\_}{nou}}^{(i)}}{\partial p_{l}^{(i)}} \cdot {\overset{.}{p}}_{l}^{(i)}}} \right)} + {\left( \left. {H_{{l\_}{nou}}^{(i)} - H_{D}^{(i)}} \right|_{t_{0}} \right) \cdot \left( {{\frac{\partial H_{{l\_ u}j}^{(i)}}{\partial q_{s}^{(i)}} \cdot {\overset{.}{q}}_{s}^{(i)}} + {\frac{\partial H_{{l\_ u}j}^{(i)}}{\partial p_{l}^{(i)}} \cdot {\overset{.}{p}}_{l}^{(i)}}} \right)}} \right) \middle| {}_{t\_ start}\mspace{20mu}\left. {\left( {E\; 6} \right)\mspace{14mu}\text{-}\mspace{14mu}{Set}\mspace{14mu} t_{start}}\leftarrow{t_{start} + {{\delta_{t}/{n_{st}\mspace{20mu}\left( {E\; 7} \right)}}\mspace{14mu}\text{-}\mspace{14mu} t_{start}}} \right. \right. = {\tau + {\delta_{t}?}}}}}}$ If no, return to (E5), and otherwise update τ←τ+δ_(t) (E8)—τ=t₀+Δ_(T)? If no, proceed to (E9), and otherwise jump to (F). (E9)—

${{{p(\tau)} = \frac{\partial{L\left( {q,\overset{.}{q},u} \right)}}{\partial\overset{.}{q}}}}_{\tau}$ Return to (E). (F) Triangle window filter—apply triangle window filter to compute q _(T), p _(T), ū

-   -   Compute weights: for i=1, 2, . . . , 2·K,         ω(t ₀ +i·δ _(t))=i/K if i≤K;ω(t ₀ +i·δ _(t))=2−i/K if i>K     -   Compute weighted average:

${\overset{¯}{u} = \frac{\sum\limits_{i = 1}^{2 \cdot K}{{\omega\left( {t_{0} + {i \cdot \delta_{t}}} \right)} \cdot {u\left( {t_{0} + {i \cdot \delta_{t}}} \right)}}}{\sum\limits_{i = 1}^{2 \cdot K}{\omega\left( {t_{0} + {i \cdot \delta_{t}}} \right)}}},{\overset{¯}{q} = \frac{\sum\limits_{i = 1}^{2 \cdot K}{{\omega\left( {t_{0} + {i \cdot \delta_{t}}} \right)} \cdot {q\left( {t_{0} + {i \cdot \delta_{t}}} \right)}}}{\sum\limits_{i = 1}^{2 \cdot K}{\omega\left( {t_{0} + {i \cdot \delta_{t}}} \right)}}},{\overset{¯}{p} = \frac{\sum\limits_{i = 1}^{2 \cdot K}{{\omega\left( {t_{0} + {i \cdot \delta_{t}}} \right)} \cdot {p\left( {t_{0} + {i \cdot \delta_{t}}} \right)}}}{\sum\limits_{i = 1}^{2 \cdot K}{\omega\left( {t_{0} + {i \cdot \delta_{t}}} \right)}}},$ (G) Provide outputs q,p,ū,q(t ₀ +i·δ _(t)),p(t ₀ +i·δ _(t)),u(t ₀ +i·δ _(t)), for i=0,1,2, . . . ,2·K (H) For outer loop, use sliding window: (H1)—Initialization: initialize the current time t₀ to be the wall clock time and initialize time window [t₀, t₀+Δ_(T)] (H2)—Call window sub routine—propagator and triangle window filter—to get q,p,ū,q(t ₀ +i·δ _(t)),p(t ₀ +i·δ _(t)),u(t ₀ +i·δ _(t)), for i=0,1,2, . . . ,2·K, where δ_(t)=Δ_(T)/2K (H3)—Sliding the time window to [t₀+Δ_(T), t₀+2Δ_(T)] (H4)—Wait until the current time clock goes to t₀+Δ_(T)/2, output q, p, ū as the actions for the future time interval [t₀+Δ_(T)/2, t₀+3Δ_(T)/2] (H5)—Wait until the current time clock goes to t₀+Δ_(T)/2, update the current time t₀←t₀+Δ_(T)

Thus, a control state manager component may determine improvements to control state for one or more actuators of one or more control elements of a target system in various ways, including as discussed above. In addition, a control state coordination manager component may synchronize control state improvements determined by control state manager components for multiple decision modules in various manners, with one example of such synchronization including the following operations performed on behalf of a particular control state coordination manager component of a decision module on behalf of that decision module (referred to as the ‘i^(th) agent’ in this example).

First, construct the local data Hamiltonian model of the i^(th) agent. As part of doing so, the local Lagrangian of the i^(th) agent is defined as follows: L _(l) ^((i))(q _(l) ^((i)) ,{dot over (q)} _(l) ^((i)) ,u _(l) ^((i)))=Σ_(j) E _(j) ^((i))−Σ_(j) V _(j) ^((i))+Σ_(j) D _(j) ^((i))+Σ_(j) F _(j) ^((i)) where q_(l) ^((i)) is the local Lagrangian state vector of the i^(th) agent, u_(l) ^((i)) is control vector of the i^(th) agent, and {dot over (q)}_(l) ^((i)) is the changing rate of the state vector q_(l) ^((i)) over time; E_(j) ^((i)), V_(j) ^((i)), D_(j) ^((i)) and F_(j) ^((i)) are kinetic energy, potential energy, dissipation energy and external force respectively of the device j belongs to the i^(th) agent, and the sum is made for the energies of all devices contained in the i^(th) agent. Notice that each term is the energy term accumulated from a given starting time t₀. And accumulation of the energy is restarted for every δ_(t) time interval, where δ_(t) is numerically determined and for different agent, and δ_(t) might be different for different agent. The local Hamiltonian of the i^(th) agent is given by the following: H _(l) ^((i))(q _(l) ^((i)) ,p _(l) ^((i)) ,u _(l) ^((i)))=p _(l) ^((i)) ^(T) ·{dot over (q)} _(l) ^((i)) −L _(l) ^((i))(q _(l) ^((i)) ,{dot over (q)} _(l) ^((i)) ,u _(l) ^((i))) where p_(l) ^((i)) is momentum vector, which has the same dimensions as the state vector q_(l) ^((i)). The momentum is defined as follows, per Dirac:

$p_{l}^{(i)} = \frac{\partial{L_{l}^{(i)}\left( {q_{l}^{(i)},{\overset{.}{q}}_{l}^{(i)},u_{l}^{(i)}} \right)}}{\partial{\overset{.}{q}}_{l}^{(i)}}$ The Hamilton Jacobi equations of the local Hamiltonian are given below.

${\overset{.}{q}}_{l}^{(i)} = \frac{\partial{H_{l}^{(i)}\left( {q_{l}^{(i)},p_{l}^{(i)},u_{l}^{(i)}} \right)}}{\partial p_{l}^{(i)}}$ ${\overset{.}{p}}_{l}^{(i)} = {- \frac{\partial{H_{l}^{(i)}\left( {q_{l}^{(i)},p_{l}^{(i)},u_{l}^{(i)}} \right)}}{\partial q_{l}^{(i)}}}$

Next, construct a local quenched mean field data Hamiltonian model for the i^(th) agent. Before constructing the quenched mean field Hamiltonian, the mean field Lagrangian is first computed, which is the sum of the local Lagrangian of each agent in the system, i.e. L _(MF)(q _(T) ,{dot over (q)} _(MF) ,u _(MF))=E _(j) L _(l) ^((j)) where L_(MF) is the notation of the mean field Lagrangian, q_(MF) and U_(MF) are collections of all distinct state variables and control variables of entire network, and {dot over (q)}_(MF) is the changing rate of q_(MF). Given the mean field Lagrangian defined above, a quenched mean field Lagrangian is constructed for the i^(th) agent as follows: only the entries of the vectors q_(MF), {dot over (q)}_(MF) and u_(T) corresponding to the state vector q_(l) ^((i)) and it's changing rate {dot over (q)}_(l) ^((i)) and the control vector u_(l) ^((i)) associated with the i^(th) agent are considered as variables. The other entries of q_(MF), {dot over (q)}_(MF) and u_(MF) are quenched as follows: keep q_(MF) and u_(MF) or other variables constant as what they are from the last time they were changed or measured, consistent with the conservation rules of the systems under control, and set the state changing rate {dot over (q)}_(MF) to be 0. The following notation is used to denote the quenched Lagrangian for the i^(th) agent: L _(MF) ^((i))(q _(MF) ^((i)) ,{dot over (q)} _(MF) ^((i)) u)=L _(MF)(q _(MF) ^((i)) ,{dot over (q)} _(MF) ^((i)) ,u _(MF) ^((i)),(q _(MF\l) _(i) ,{dot over (q)} _(MF\l) _(i) ,u _(MF\l) _(i) )|quench) where q_(MF) ^((i)) and u_(MF) ^((i)) are the mean field state vector and control vector corresponding to the q_(l) ^((i)) and u_(l) ^((i)) of the i^(th) agent, and {dot over (q)}_(MF) ^((i)) is the changing rate of q_(MF) ^((i)). Given the quenched mean field Lagrangian for the i^(th) agent, the quenched mean field Hamiltonian of the i^(th) agent is given by the following:

${H_{MF}^{(i)}\left( {q_{MF}^{(i)},p_{MF}^{(i)},u_{MF}^{(i)}} \right)} = {{p_{MF}^{{(i)}T} \cdot {\overset{.}{q}}_{MF}^{(i)}} - {L_{MF}^{(i)}\left( {q_{MF}^{(i)},{\overset{.}{q}}_{MF}^{(i)},u_{MF}^{(i)}} \right)}}$ where p_(MF) ^((i)) is momentum vector, which has the same dimensions as the state vector q_(MF) ^((i)). The momentum, per Dirac, is defined as follows:

$p_{MF}^{(i)} = \frac{L_{MF}^{(i)}\left( {q_{MF}^{(i)},{\overset{.}{q}}_{MF}^{(i)},u_{MF}^{(i)}} \right)}{\partial{\overset{.}{q}}_{MF}^{(i)}}$ The Hamilton Jacobi equations of the quenched mean field Hamiltonian of the i^(th) agent are given below.

${\overset{.}{q}}_{MF}^{(i)} = \frac{\partial{H_{MF}^{(i)}\left( {q_{MF}^{(i)},p_{MF}^{(i)},u_{MF}^{(i)}} \right)}}{\partial p_{MF}^{(i)}}$ ${\overset{.}{p}}_{MF}^{(i)} = {- \frac{\partial{H_{MF}^{(i)}\left( {q_{MF}^{(i)},p_{MF}^{(i)},u_{MF}^{(i)}} \right)}}{\partial q_{MF}^{(i)}}}$

Next, construct a local synchronized mean field data Hamiltonian model for the i^(th) agent. To construct a synchronized Hamiltonian for the i^(th) agent, first construct a synchronized Lagrangian as follows: L _(s)=γ^((i)) ·L _(MF) ^((i))(q _(MF) ^((i)) ,{dot over (q)} _(MF) ^((i)) ,u _(MF) ^((i)))+(1−γ^((i)))·L _(l) ^((i))(q _(l) ^((i)) ,{dot over (q)} _(l) ^((i)) ,u _(l) ^((i))) where

-   -   L_(MF) ^((i))(q_(MF) ^((i)), {dot over (q)}_(MF) ^((i)), u_(MF)         ^((i)))         is the quenched mean field Lagrangian of the i^(th) agent,     -   L_(l) ^((i))(q_(l) ^((i)), {dot over (q)}_(l) ^((i)), u_(l)         ^((i)))         is the local Lagrangian of the i^(th) agent, and γ^((i)) is the         weight for constructing synchronized Lagrangian. Notice that         γ^((i)) is not algorithmically computable, and hence is set         heuristically. Use normalized Lagrangian to set γ^((i)), such         that

$\gamma^{(i)} = \frac{\left( {{L_{{l\_}{({{{recent}\delta}_{t}^{(i)}{interval}})}}^{(i)}}/\delta_{t}^{(i)}} \right)}{\sum\limits_{j}\;\left( {{L_{{l\_}{({{{recent}\delta}_{t}^{(j)}{interval}})}}^{(j)}}/\delta_{t}^{(j)}} \right)}$ The reason for using normalized Lagrangian is that, as mentioned in previous section, for a certain agent CDI, the Lagrangian is the sum of all accumulated energy terms, and the accumulation of energy for every δ_(t) time interval is restarted for practical reasons. Since δ_(t) is numerically determined, fδ_(t) might be different for different agents. Therefore, before adding the Lagrangian of different agents for computing γ^((i)), the agent Lagrangian is normalized. Since q_(MF) ^((i)), {dot over (q)}_(MF) ^((i)) and u_(MF) ^((i)) appeared in quenched mean field Lagrangian

-   -   L_(MF) ^((i))         and q_(l) ^((i)), {dot over (q)}_(l) ^((i)) and u_(l) ^((i))         appeared in local agent Lagrangian     -   L_(l) ^((i))         are the same variables, synchronized variables     -   q_(s) ^((i)), {dot over (q)}_(s) ^((i)), u_(s) ^((i))     -   are introduced to represent both q_(MF) ^((i)), {dot over         (q)}_(MF) ^((i)), u_(MF) ^((i)) and q_(l) ^((i)), {dot over         (q)}_(l) ^((i)), u_(l) ^((i)), and rewrite the synchronized         Lagrangian as follows:         L _(s)(q _(s) ^((i)) ,{dot over (q)} _(s) ^((i)) ,u _(s)         ^((i)))=γ^((i)) ·L _(MF) ^((i))(q _(s) ^((i)) ,{dot over (q)}         _(s) ^((i)) ,u _(s) ^((i)))+(1−γ^((i)))·L _(l) ^((i))(q _(s)         ^((i)) ,{dot over (q)} _(s) ^((i)) ,u _(s) ^((i)))  (1)         Given the synchronized Lagrangian, construct the synchronized         Hamiltonian for the i^(th) agent as follows:         H _(s) ^((i))(q _(s) ^((i)) ,p _(s) ^((i)) ,u _(s) ^((i)))=p         _(s) ^((i)T) ·{dot over (q)} _(s) ^((i)) −L _(s)(q _(s) ^((i))         ,{dot over (q)} _(s) ^((i)) ,u _(s) ^((i)))  (2)         where the momentum p_(s) ^((i)) is defined by

$\begin{matrix} {p_{s}^{(i)} = \frac{\partial{L_{s}\left( {q_{s}^{(i)},{\overset{.}{q}}_{s}^{(i)},u_{s}^{(i)}} \right)}}{\partial{\overset{.}{q}}_{s}^{(i)}}} & (3) \end{matrix}$ The synchronized Hamiltonian for the i^(th) agent given by equation (1) has the following properties: p _(s) ^((i))=γ^((i)) ·p _(MF) ^((i))+(1−γ^((i)))·p _(l) ^((i))  (1) H _(s) ^((i))(q _(s) ^((i)) ,p _(s) ^((i)) ,u _(s) ^((i)))=γ^((i)) ·H _(MF) ^((i))(q _(s) ^((i)) ,p _(MF) ^((i)) ,u _(s) ^((i)))+(1−γ^((i)))·H _(l) ^((i))(q _(s) ^((i)) ,p _(l) ^((i)) ,u _(s) ^((i)))  (2) where

$p_{MF}^{(i)} = \frac{L_{MF}^{(i)}\left( {q_{MF}^{(i)},{\overset{.}{q}}_{MF}^{(i)},u_{MF}^{(i)}} \right)}{\partial{\overset{.}{q}}_{MF}^{(i)}}$ $p_{l}^{(i)} = \frac{\partial{L_{l}^{(i)}\left( {q_{l}^{(i)},{\overset{.}{q}}_{l}^{(i)},u_{l}^{(i)}} \right)}}{\partial{\overset{.}{q}}_{l}^{(i)}}$ Proof: According to the definition of

-   -   L_(s)(q_(s) ^((i)), {dot over (q)}_(s) ^((i)), u_(s) ^((i)))         given by equation (1), the synchronized momentum p_(s) ^((i))         defined by equation (3) is equivalent to

$\begin{matrix} {p_{s}^{(i)} = \frac{{\gamma^{(i)} \cdot {L_{MF}^{(i)}\left( {q_{s}^{(i)},{\overset{.}{q}}_{s}^{(i)},u_{s}^{(i)}} \right)}} + {\left( {1 - \gamma^{(i)}} \right) \cdot {L_{l}^{(i)}\left( {q_{s}^{(i)},{\overset{.}{q}}_{s}^{(i)},u_{s}^{(i)}} \right)}}}{\partial{\overset{.}{q}}_{s}^{(i)}}} \\ {= {{\gamma^{(i)} \cdot \frac{L_{MF}^{(i)}\left( {q_{s}^{(i)},{\overset{.}{q}}_{s}^{(i)},u_{s}^{(i)}} \right)}{\partial{\overset{.}{q}}_{s}^{(i)}}} + {\left( {1 - \gamma^{(i)}} \right) \cdot \frac{L_{l}^{(i)}\left( {q_{s}^{(i)},{\overset{.}{q}}_{s}^{(i)},u_{s}^{(i)}} \right)}{\partial{\overset{.}{q}}_{s}^{(i)}}}}} \end{matrix}$ And as mentioned earlier, q_(MF) ^((i)), {dot over (q)}_(MF) ^((i)), u_(MF) ^((i)) appeared in quenched mean field Lagrangian

-   -   L_(MF) ^((i))         and q_(l) ^((i)), {dot over (q)}_(l) ^((i)) and u_(l) ^((i))         appeared in local agent Lagrangian     -   L_(l) ^((i))         are the same variables appeared in L_(s)(q_(s) ^((i)), {dot over         (q)}_(s) ^((i)), u_(s) ^((i))), equation of p_(s) ^((i)) can be         rewritten as follows:

$p_{s}^{(i)} = {{\gamma^{(i)} \cdot \frac{L_{MF}^{(i)}\left( {q_{MF}^{(i)},{\overset{.}{q}}_{MF}^{(i)},u_{MF}^{(i)}} \right)}{\partial{\overset{.}{q}}_{MF}^{(i)}}} + {\left( {1 - \gamma^{(i)}} \right) \cdot \frac{L_{l}^{(i)}\left( {q_{l}^{(i)},{\overset{.}{q}}_{l}^{(i)},u_{l}^{(i)}} \right)}{\partial{\overset{.}{q}}_{l}^{(i)}}}}$ And $p_{MF}^{(i)} = \frac{L_{MF}^{(i)}\left( {q_{MF}^{(i)},{\overset{.}{q}}_{MF}^{(i)},u_{MF}^{(i)}} \right)}{\partial{\overset{.}{q}}_{MF}^{(i)}}$ $p_{l}^{(i)} = \frac{\partial{L_{l}^{(i)}\left( {q_{l}^{(i)},{\overset{.}{q}}_{l}^{(i)},u_{l}^{(i)}} \right)}}{\partial{\overset{.}{q}}_{l}^{(i)}}$ therefore p _(s) ^((i))=γ^((i)) ·p _(MF) ^((i))+(1γ^((i)))·p _(l) ^((i)) The property (1) is proven. Next property (2) is proven. According to the definition of L_(s)(q_(s) ^((i)), {dot over (q)}_(s) ^((i)), u_(s) ^((i))) given by equation (1), the synchronized Hamiltonian defined by equation (2) is equivalent to H _(s) ^((i))(q _(s) ^((i)) ,p _(s) ^((i)) ,u _(s) ^((i)))=p _(s) ^((i)T) ·{dot over (q)} _(s) ^((i))−γ^((i)) ·L _(MF) ^((i))(q _(s) ^((i)) ,{dot over (q)} _(s) ^((i)) ,u _(s) ^((i)))−1−γ^((i)))·L _(l) ^((i))(q _(s) ^((i)) ,{dot over (q)} _(s) ^((i)) ,u _(s) ^((i))) And plugging in the equation given by property (1) gives the following: H _(s) ^((i))(q _(s) ^((i)) ,p _(s) ^((i)) ,u _(s) ^((i)))=(γ^((i)) ·p _(MF) ^((i))+(1−γ^((i)))·p _(l) ^((i)))^(T) ·{dot over (q)} _(s) ^((i))−γ^((i)) ·L _(MF) ^((i))(q _(s) ^((i)) ,{dot over (q)} _(s) ^((i)) ,u _(s) ^((i)))−(1−γ^((i)))·L _(l) ^((i))(q _(s) ^((i)) ,{dot over (q)}=γ ^((i))·(p _(MF) ^((i)T) ,{dot over (q)} _(s) ^((i)) −L _(MF) ^((i))(q _(s) ^((i)) ,{dot over (q)} _(s) ^((i)) ,u _(s) ^((i))))+(1−γ^((i)))·(p _(l) ^((i)T) ·{dot over (q)} _(s) ^((i)) −L _(l) ^((i))(q _(s) ^((i)) ,{dot over (q)} _(s) ^((i)) ,u _(s) ^((i))) And as mentioned earlier, q_(MF) ^((i)), {dot over (q)}_(MF) ^((i)) and u_(s) ^((i)) appeared in quenched mean field Lagrangian

-   -   L_(MF) ^((i))         and q_(l) ^((i)), {dot over (q)}_(l) ^((i)) and u_(l) ^((i))         appeared in local agent Lagrangian     -   L_(l) ^((i))         are the same variables appeared in L_(s)(q_(s) ^((i)), {dot over         (q)}_(s) ^((i)), u_(s) ^((i))), equation of H_(s) ^((i))(q_(s)         ^((i)), p_(s) ^((i)), u_(s) ^((i))) can be rewritten as         H _(s) ^((i))(q _(s) ^((i)) ,p _(s) ^((i)) ,u _(s)         ^((i)))=γ^((i))·(p _(MF) ^((i)T) ·{dot over (q)} _(MF) ^((i)) −L         _(MF) ^((i))(q _(MF) ^((i)) ,{dot over (q)} _(MF) ^((i)) ,u         _(MF) ^((i))))+(1−γ^((i)))·(p _(l) ^((i)T) ·{dot over (q)} _(l)         ^((i)) −L _(l) ^((i))(q _(l) ^((i)) ,{dot over (q)} _(l) ^((i)         And since         H _(MF) ^((i))(q _(MF) ^((i)) ,p _(MF) ^((i)) ,u _(MF) ^((i)))=p         _(MF) ^((i)T) ·{dot over (q)} _(MF) ^((i)) −L _(MF) ^((i))(q         _(MF) ^((i)) ,{dot over (q)} _(MF) ^((i)) ,u _(MF) ^((i)))         H _(l) ^((i))(q _(l) ^((i)) ,p _(l) ^((i)) ,u _(l) ^((i)))=p         _(l) ^((i)T) ·{dot over (q)} _(l) ^((i)) −L _(l) ^((i))(q _(l)         ^((i)) ,{dot over (q)} _(l) ^((i)) ,u _(l) ^((i)))         results in         H _(s) ^((i))(q _(s) ^((i)) ,p _(s) ^((i)) ,u _(s)         ^((i)))=γ^((i)) ·H _(MF) ^((i))(q _(s) ^((i)) ,p _(MF) ^((i)) ,u         _(s) ^((i)))+(1−γ^((i)))·H _(l) ^((i))(q _(s) ^((i)) ,p _(l)         ^((i)) ,u _(s) ^((i)))

Next, apply control law propagator techniques of a control state manager component to generate synchronized control for the i^(th) agent, with the particular desired behavior C_(s) ^((i)) for computing the control law able to be automatically extracted from behavior rules or instead specified as configuration information. In particular, for the i^(th) agent, and given the equations of quenched mean field Hamiltonian

-   -   H_(MF) ^((i))(q_(s) ^((i)), p_(MF) ^((i)), u_(s) ^((i)))         and local Hamiltonian H_(l) ^((i))(q_(s) ^((i)), p_(l) ^((i)),         u_(s) ^((i))) and the equation of the local desired Hamiltonian     -   H_(D) ^((i))(q_(D) ^((i)), p_(D) ^((i))),         the desired behavior of the synchronized CDI control law         propagator model for the agent is defined as follows:

$\begin{matrix} {{\min\; C_{s}^{(i)}} = {{\frac{\gamma^{(i)}}{2} \cdot \left( {{H_{MF}^{(i)}\left( {q_{s}^{(i)},p_{MF}^{(i)},u_{s}^{(i)}} \right)} - {H_{D}^{(i)}\left( {q_{D}^{(i)},p_{D}^{(i)}} \right)}} \right)^{2}} + {\frac{\left( {1 - \gamma^{(i)}} \right)}{2} \cdot \left( {{H_{l}^{(i)}\left( {q_{s}^{(i)},p_{l}^{(i)},u_{s}^{(i)}} \right)} - {H_{D}^{(i)}\left( {q_{D}^{(i)},p_{D}^{(i)}} \right)}} \right)^{2}}}} & (4) \end{matrix}$ where u_(s) ^((i)) is the synchronized control vector of agent i, q_(s) ^((i)) is state vector of agent i, p_(MF) ^((i)) is the momentum of q_(s) ^((i)) appeared in quenched mean field Hamiltonian, and p_(l) ^((i)) is the momentum of q_(s) ^((i)) appeared in local Hamiltonian. As given above, p_(MF) ^((i)) and p_(l) ^((i)) follow the following, per Dirac:

$p_{MF}^{(i)} = \frac{L_{MF}^{(i)}\left( {q_{s}^{(i)},{\overset{.}{q}}_{s}^{(i)},u_{s}^{(i)}} \right)}{\partial{\overset{.}{q}}_{s}^{(i)}}$ $p_{l}^{(i)} = \frac{L_{l}^{(i)}\left( {q_{s}^{(i)},{\overset{.}{q}}_{s}^{(i)},u_{s}^{(i)}} \right)}{\partial{\overset{.}{q}}_{s}^{(i)}}$ The state vector and the momentum vectors satisfy the Hamilton Jacobi equations [2], i.e.

${\overset{.}{q}}_{s}^{(i)} = {{\gamma^{(i)} \cdot \frac{\partial{H_{MF}^{(i)}\left( {q_{s}^{(i)},p_{MF}^{(i)},u_{s}^{(i)}} \right)}}{\partial p_{MF}^{(i)}}} + {\left( {1 - \gamma^{(i)}} \right) \cdot \frac{\partial{H_{l}^{(i)}\left( {q_{s}^{(i)},p_{l}^{(i)},u_{s}^{(i)}} \right)}}{\partial p_{l}^{(i)}}}}$ ${\overset{.}{p}}_{MF}^{(i)} = {- \frac{\partial{H_{MF}^{(i)}\left( {q_{s}^{(i)},p_{MF}^{(i)},u_{s}^{(i)}} \right)}}{\partial q_{s}^{(i)}}}$ ${\overset{.}{p}}_{l}^{(i)} = {- \frac{\partial{H_{l}^{(i)}\left( {q_{s}^{(i)},p_{l}^{(i)},u_{s}^{(i)}} \right)}}{\partial q_{s}^{(i)}}}$ and the dynamics of u_(s) ^((i)) is given by [3],

${\overset{.}{u}}_{s}^{(i)} = {{{- \Gamma^{(i)}} \cdot \frac{\partial}{\partial u_{s}^{(i)}}}\left( \frac{{{dC}_{s}^{(i)}}_{u_{s}^{(i)}}}{dt} \right)}$ where Γ^((i)) is a positive scalar which can be viewed as step size, and

$\frac{{{dC}_{s}^{(i)}}_{u_{s}^{(i)}}}{dt}$ is the derivative over time t with a fixed value of u_(s) ^((i)). For the i^(th) agent, given the equations of quenched mean field Hamiltonian

-   -   H_(MF) ^((i))(q_(s) ^((i)), p_(MF) ^((i)), u_(s) ^((i)))         and local Hamiltonian H_(l) ^((i)) (q_(s) ^((i)), p_(l) ^((i)),         u_(s) ^((i))), and with the desired behavior C_(s) ^((i)) given         by equation (4), the dynamics of u_(s) ^((i)) can be summarized         as follows. First, the Hamiltonian data model can be written         with two parts, in which one part depends on the control vector,         and the other part does not, with the control vector appearing         in the Hamiltonian data model with the following form:         H(q,p,u)=H _(nou)(q,p)+Σ_(j=1) ^(m)(H _(uj)(q,p)·u _(j))         where m is the total number of controls. Therefore, H_(MF)         ^((i)) (q_(s) ^((i)), p_(MF) ^((i)), u_(s) ^((i))) and H_(l)         ^((i))(q_(s) ^((i)), p_(l) ^((i)), u_(s) ^((i))) can be written         as the following:

${H_{MF}^{(i)}\left( {q_{s}^{(i)},p_{MF}^{(i)},u_{s}^{(i)}} \right)} = {{H_{{MF}\_{nou}}^{(i)}\left( {q_{s}^{(i)},p_{MF}^{(i)}} \right)} + {\sum\limits_{j = 1}^{m}\;\left( {{H_{{MF}\_{uj}}^{(i)}\left( {q_{s}^{(i)},p_{MF}^{(i)}} \right)} \cdot u_{sj}^{(i)}} \right)}}$ ${H_{l}^{(i)}\left( {q_{s}^{(i)},p_{l}^{(i)},u_{s}^{(i)}} \right)} = {{H_{l\_{nou}}^{(i)}\left( {q_{s}^{(i)},p_{l}^{(i)}} \right)} + {\sum\limits_{j = 1}^{m}\;\left( {{H_{l\_{uj}}^{(i)}\left( {q_{s}^{(i)},p_{l}^{(i)}} \right)} \cdot u_{sj}^{(i)}} \right)^{t_{start}}}}$ The dynamics of u_(s) ^((i)) over a time window [t_(start), t_(end)] with initial conditions given at t_(start) are summarized as follows.

${{{{{{{{{{\overset{.}{u}}_{s}^{(i)} = {\frac{{du}_{s}^{(i)}(t)}{dt} = {{- \Gamma^{(i)}} \cdot \left\lbrack {{\gamma^{(i)} \cdot \left( {{\alpha_{{MF}\_ j}\left( t_{start} \right)} + {\sum\limits_{k = 1}^{m}\;{{\beta_{{MF}\_{jk}}\left( t_{start} \right)} \cdot {u_{sk}^{(i)}(t)}}}} \right)} + {\left( {1 - \gamma^{(i)}} \right) \cdot \left( {{\alpha_{l\_ j}\left( t_{start} \right)} + {\sum\limits_{k = 1}^{m}\;{{\beta_{l\_{jk}}\left( t_{start} \right)} \cdot {u_{sk}^{(i)}(t)}}}} \right)}} \right\rbrack}}}\mspace{20mu}{where}{{\alpha_{{MF}\_ j}\left( t_{tstart} \right)} = \left\lbrack {{H_{{MF}\_{uj}}^{(i)} \cdot \left( {{\frac{\partial H_{{MF}\_{nou}}^{(i)}}{\partial q_{s}} \cdot {\overset{.}{q}}_{s}^{(i)}} + {\frac{\partial H_{{MF}\_{nou}}^{(i)}}{\partial p_{MF}} \cdot {\overset{.}{p}}_{MF}^{(i)}}} \right)} + {\left( {{H_{{MF}\_{nou}}^{(i)} - H_{D}^{(i)}}❘_{t_{0}}} \right) \cdot \left( {{\frac{\partial H_{{MF}\_{uj}}^{(i)}}{\partial q_{s}} \cdot {\overset{.}{q}}_{s}^{(i)}} + {\frac{\partial H_{{MF}\_{uj}}^{(i)}}{\partial p_{MF}} \cdot {\overset{.}{p}}_{MF}^{(i)}}} \right)}} \right\rbrack}}}_{t_{start}}{{\beta_{{MF}\_{jk}}\left( t_{start} \right)} = \left\lbrack {{H_{{MF}\_{uj}}^{(i)} \cdot \left( {{\frac{\partial H_{{MF}\_{uk}}^{(i)}}{\partial q_{s}} \cdot {\overset{.}{q}}_{s}^{(i)}} + {\frac{\partial H_{{MF}\_{uk}}^{(i)}}{\partial p_{MF}} \cdot {\overset{.}{p}}_{MF}^{(i)}}} \right)} + {H_{{MF}\_{uk}}^{(i)} \cdot \left( {{\frac{\partial H_{{MF}\_{uj}}^{(i)}}{\partial q_{s}} \cdot {\overset{.}{q}}_{s}^{(i)}} + {\frac{\partial H_{{MF}\_{uj}}^{(i)}}{\partial p_{MF}} \cdot {\overset{.}{p}}_{MF}^{(i)}}} \right)}} \right\rbrack}}}_{t_{start}}{{\alpha_{l\_ j}\left( t_{tstart} \right)} = \left\lbrack {{H_{l\_{uj}}^{(i)} \cdot \left( {{\frac{\partial H_{l\_{nou}}^{(i)}}{\partial q_{s}} \cdot {\overset{.}{q}}_{s}^{(i)}} + {\frac{\partial H_{l\_{nou}}^{(i)}}{\partial p_{l}} \cdot {\overset{.}{p}}_{l}^{(i)}}} \right)} + {\left( {{H_{l\_{nou}}^{(i)} - H_{D}^{(i)}}❘_{t_{0}}} \right) \cdot \left( {{\frac{\partial H_{l\_{uj}}^{(i)}}{\partial q_{s}} \cdot {\overset{.}{q}}_{s}^{(i)}} + {\frac{\partial H_{l\_{uj}}^{(i)}}{\partial p_{l}} \cdot {\overset{.}{p}}_{l}^{(i)}}} \right)}} \right\rbrack}}}_{t_{start}}{{\beta_{l\_{jk}}\left( t_{start} \right)} = \left\lbrack {{H_{l}^{(i)}{{F\_{uj}} \cdot \left( {{\frac{\partial H_{l\_{uk}}^{(i)}}{\partial q_{s}} \cdot {\overset{.}{q}}_{s}^{(i)}} + {\frac{\partial H_{l\_{uk}}}{(i)}{{\partial p_{l}} \cdot {\overset{.}{p}}_{l}^{(i)}}}} \right)}} + {H_{l\_{uk}}^{(i)} \cdot \left( {{\frac{\partial H_{l\_{uj}}^{(i)}}{\partial q_{s}} \cdot {\overset{.}{q}}_{s}^{(i)}} + {\frac{\partial H_{l\_{uj}}^{(i)}}{\partial p_{l}} \cdot {\overset{.}{p}}_{l}^{(i)}}} \right)}} \right\rbrack}}}_{t_{start}}\;$ where t₀ is the time to evaluate the desired Hamiltonian, and t₀≤t_(start). By applying the CDI control law propagator techniques of the control state manager component, control u_(s) ^((i)) for the synchronized model of the i^(th) agent can be generated.

These details provide a procedure for one example embodiment of mean field-based synchronization of control state improvement information for multiple decision modules (or ‘agents’), as follows:

(A) Start with a first input of agent window parameters (for agent k=1, 2, . . . , all agents): window length Δ_(T) ^((k)); number of points to be sampled in half window: K^((k)); CDI bucket: δ_(t) ^((k))=Δ_(T) ^((k)))/(2*K^((k))), Number of integration steps within δ_(t) ^((k)) time segment: n_(st) ^((k)) (B) Continue with a second input of agent equations (for agent k=1, 2, . . . , all agents):

-   -   equations regarding to agent local Hamiltonian and         Lagrangian^((1*)):

${L_{l}^{(k)}\left( {q_{l}^{(k)},{\overset{.}{q}}_{l}^{(k)},u_{l}^{(k)}} \right)},\frac{\partial{L_{l}^{(k)}\left( {q_{l}^{(k)},{\overset{.}{q}}_{l}^{(k)},u_{l}^{(k)}} \right)}}{\partial{\overset{.}{q}}_{l}^{(k)}},{H_{l\_{nou}}^{(k)}\left( {q_{l}^{(k)},p_{l}^{(k)},\lambda_{l}^{(k)}} \right)},\frac{\partial{H_{l\_{nou}}^{(k)}\left( {q_{l}^{(k)},p_{l}^{(k)},\lambda_{l}^{(k)}} \right)}}{\partial q_{l}^{(k)}},\frac{\partial{H_{l\_{nou}}^{(k)}\left( {q_{l}^{(k)},p_{l}^{(k)},\lambda_{l}^{(k)}} \right)}}{\partial p_{l}^{(k)}},{H_{l\_{uj}}^{(k)}\left( {q_{l}^{(k)},p_{l}^{(k)}} \right)},\frac{\partial{H_{l\_{uj}}^{(k)}\left( {q_{l}^{(k)},p_{l}^{(k)}} \right)}}{\partial q_{l}^{(k)}},\frac{\partial{H_{l\_{uj}}^{(k)}\left( {q_{l}^{(k)},p_{l}^{(k)}} \right)}}{\partial p_{l}^{(k)}},{{{for}\mspace{14mu} j} = 1},2,\ldots\mspace{14mu},m_{k}$

-   -   agent desired Hamiltonian, desired Lagrangian and its         derivatives^((2*)):

${H_{lD}^{(k)}\left( {q_{lD}^{(k)},p_{lD}^{(k)}} \right)},{L_{lD}^{(k)}\left( {q_{lD}^{(k)},{\overset{.}{q}}_{lD}^{(k)}} \right)},\frac{\partial{L_{lD}^{(k)}\left( {q_{lD}^{(k)}{\overset{.}{,q}}_{lD}^{(k)}} \right)}}{\partial{\overset{.}{q}}_{lD}^{(k)}}$

-   -   agent hard rule matrix M_(l) ^((k)) (q_(l) ^((k)), p_(l) ^((k)))         and vector V_(l) ^((k))(q_(l) ^((k)), p_(l) ^((k)), u_(l)         ^((k))) (each entry of vector or matrix is an equation)     -   agent synchronized control law parameters: Γ_(s) ^((k))     -   equations regarding to agent quenched mean field Hamiltonian         ^((3*)):

$\left. {\left. {H_{{MF}\_{nou}}^{(k)}\left( {q_{MF}^{(k)},p_{MF}^{(k)},\left\{ {q_{{MF}\backslash l_{k}},u_{{MF} \smallsetminus l_{k}}} \right\}} \right.}_{quench} \right),\frac{\left. {\partial{H_{{MF}\_{nou}}^{(k)}\left( {q_{MF}^{(k)},p_{MF}^{(k)},\left\{ {q_{{MF}\backslash l_{k}},u_{{MF} \smallsetminus l_{k}}} \right\}} \right.}_{quench}} \right)}{\partial q_{MF}^{(k)}},\frac{\left. {\partial{H_{{MF}\_{nou}}^{(k)}\left( {q_{MF}^{(k)},p_{MF}^{(k)},\left\{ {q_{{MF}\backslash l_{k}},u_{{MF} \smallsetminus l_{k}}} \right\}} \right.}_{quench}} \right)}{\partial p_{MF}^{(k)}},{H_{{MF}\_{uj}}^{(k)}\left( {q_{MF}^{(k)},p_{MF}^{(k)},\left\{ {q_{{MF}\backslash l_{k}},u_{{MF} \smallsetminus l_{k}}} \right\}} \right.}_{quench}} \right),\text{}\frac{\left. {\partial{H_{{MF}\_{uj}}^{(k)}\left( {q_{MF}^{(k)},p_{MF}^{(k)},\left\{ {q_{{MF}\backslash l_{k}},u_{{MF} \smallsetminus l_{k}}} \right\}} \right.}_{quench}} \right)}{\partial q_{MF}^{(k)}},\frac{\left. {\partial{H_{{MF}\_{uj}}^{(k)}\left( {q_{MF}^{(k)},p_{MF}^{(k)},\left\{ {q_{{MF}\backslash l_{k}},u_{{MF} \smallsetminus l_{k}}} \right\}} \right.}_{quench}} \right)}{\partial p_{MF}^{(k)}},{{{for}\mspace{14mu} j} = 1},2,\ldots\mspace{14mu},m_{k}$ 1*: Agent local Hamiltonian H_(l) ^((i)) is the agent local Hamiltonian with hard rules, i.e.

$H_{l}^{(i)} = {{H_{{l\_{nou}} \smallsetminus \lambda}^{(i)}\left( {q_{l}^{(i)},p_{l}^{(i)}} \right)} + {\sum\limits_{j = 1}^{m}{{H_{l\_{uj}}^{(i)}\left( {q_{l}^{(i)},p_{l}^{(i)}} \right)} \cdot u_{lj}^{(i)}}} + {\sum\limits_{k = 1}^{I}{\lambda_{l}^{(i)} \cdot {\phi_{k}^{(i)}\left( {q_{l}^{(i)},p_{l}^{(i)}} \right)}}}}$ where ϕ_(k) ^((i))(q_(l) ^((i)), p_(l) ^((i))) for k=1, 2, . . . , I are hard rules By grouping the terms with control variable and the terms without, rewrite H_(l) ^((i)) as follows

${H_{l}^{(i)}\left( {q_{l}^{(i)},p_{l}^{(i)},u_{l}^{(i)},\lambda_{l}^{(i)}} \right)} = {{H_{l\_{nou}}^{(i)}\left( {q_{l}^{(i)},p_{l}^{(i)},\lambda_{l}^{(i)}} \right)} + {\sum\limits_{j = 1}^{m}{{H_{l\_{uj}}^{(i)}\left( {q_{l}^{(i)},p_{l}^{(i)}} \right)} \cdot u_{lj}^{(i)}}}}$ where

${H_{l\_{nou}}^{(i)}\left( {q_{l}^{(i)},p_{l}^{(i)},\lambda_{l}^{(i)}} \right)} = {{H_{{l\_{nou}}\backslash\lambda}^{(i)}\left( {q_{l}^{(i)},p_{l}^{(i)}} \right)} + {\sum\limits_{k = 1}^{I}\;{\lambda_{l}^{(i)} \cdot {\phi_{k}^{(i)}\left( {q_{l}^{(i)},p_{l}^{(i)}} \right)}}}}$ 2*: L_(D) ^((i))(q_(D) ^((i)), {dot over (q)}_(D) ^((i))) is desired Lagrangian of agent i, H_(D) ^((i))(q_(D) ^((i)), p_(D) ^((i))) is its corresponding desired Hamiltonian. The H_(D) ^((i)) is used to construct CDI agent synchronized desired behavior C_(s) ^((i)) which measures the performance differences between the agent Hamiltonians and the desired Hamiltonian, i.e.

${C_{S}^{(i)} = {{\frac{1}{2}{\left( {1 - \gamma^{(i)}} \right) \cdot \left( {{H_{l}^{(i)}\left( {q_{s}^{(i)},p_{l}^{(i)},u_{s}^{(i)},\lambda_{l}^{(i)}} \right)} - {H_{D}^{(i)}\left( {q_{D}^{(i)},p_{D}^{(i)}} \right)}} \right)^{2}}} + {\frac{1}{2}{\left( {1 - \alpha} \right) \cdot \left( {{H_{MF}^{(i)}\left( {q_{s}^{(i)},p_{MF}^{(i)},u_{s}^{(i)}} \right)} - {H_{D}^{(i)}\left( {q_{D}^{(i)},p_{D}^{(i)}} \right)}} \right)^{2}}}}},$ where H_(MF) ^((i))(q_(MF) ^((i)), p_(MF) ^((i)), u_(MF) ^((i))) is quenched mean field Hamiltonian for i^(th) agent. 3*: Synchronized Hamiltonian H_(s) ^((i))=γ^((i))·H_(MF) ^((i))(q_(s) ^((i)), p_(MF) ^((i)), u_(s) ^((i)))+(1−γ^((i))). H_(l) ^((i))(q_(s) ^((i)), p_(l) ^((i)), u_(s) ^((i))), where H_(MF) ^((i))(q_(s) ^((i)), p_(MF) ^((i)), u_(s) ^((i))) is quenched mean field Hamiltonian for i^(th) agent, H_(l) ^((i))(q_(s) ^((i)), p_(l) ^((i)), u_(s) ^((i))) is local Hamiltonian of i^(th) agent (C) Read current time t₀ (D) At current time t₀, pick up scheduled agent i according to a designed schedule (E) Read from blackboard to get the following observation measured at time t₀

-   -   state vector {circumflex over (q)}_(l) ^((i))(t₀) and it's         changing rate {circumflex over ({dot over (q)})}_(l) ^((i))(t₀)         and implemented control vector û_(l) ^((i))(t₀) of the i^(th)         agent     -   all states appeared in mean field Hamiltonian other than the         states of the i^(th) agent, as well as corresponding changing         rate: {circumflex over (q)}_(MF\l) _(i) (t₀), {circumflex over         ({dot over (q)})}_(MF\l) _(i) (t₀)     -   all controls appeared in mean field Hamiltonian other than the         control vector of the i^(th) agent: û_(MF\l) _(i) (t₀)     -   mixing rate of the i^(th) agent at time t₀: γ^((i))         (F) Set initial conditions for local Hamiltonian of agent i     -   Initial condition for state vector: q_(s) ^((i))(t₀)=q_(l)         ^((i))(t₀)={circumflex over (q)}_(l) ^((i))(t₀), {dot over         (q)}_(s) ^((i))(t₀)={dot over (q)}_(l) ^((i))(t₀)={circumflex         over ({dot over (q)})}_(l) ^((i))(t₀), q_(lD)         ^((i))(t₀)={circumflex over (q)}_(l) ^((i))(t₀), {dot over         (q)}_(lD) ^((i))(t₀)={circumflex over ({dot over (q)})}_(l)         ^((i))(t₀)     -   Initial condition for control vector: [u_(s1) ^((i))(t₀), u_(s2)         ^((i))(t₀), . . . , u_(sm) ^((i))(t₀)]^(T)=[û_(s1) ^((i))(t₀),         û_(s2) ^((i))(t₀), . . . , û_(sm) ^((i))(t₀)]^(T)     -   Initial condition for momentum vector^((4*)):

${{{{{p_{l}^{(i)}\left( t_{0} \right)} = \frac{\partial{L_{l}^{(i)}\left( {q_{s}^{(i)},{\overset{.}{q}}_{s}^{(i)},u_{s}^{(i)}} \right)}}{\partial{\overset{.}{q}}_{s}^{(i)}}}}_{t_{0}},{{p_{lD}^{(i)}\left( t_{0} \right)} = \frac{\partial{L_{lD}^{(i)}\left( {q_{lD}^{(i)},{\overset{.}{q}}_{lD}^{(i)}} \right)}}{\partial{\overset{.}{q}}_{lD}^{(i)}}}}}_{t_{0}}$ (G) For agent i, compute λ_(l) ^((i))(t₀) by solving M_(l) ^((i))({circumflex over (q)}_(l) ^((i))(t₀), p_(l) ^((i))(t₀))λ_(l) ^((i))+V_(l) ^((i))({circumflex over (q)}_(l) ^((i))(t₀), p_(l) ^((i))(t₀), û_(l) ^((i))(t₀))=0 (H) Construct local Hamiltonian of agent i

${H_{l}^{(i)}\left( {q_{s}^{(i)},p_{l}^{(i)},u_{s}^{(i)}} \right)} = {{H_{l\_{nou}}^{(i)}\left( {q_{s}^{(i)},p_{l}^{(i)},{\lambda_{l}^{(i)}\left( t_{0} \right)}} \right)} + {\sum\limits_{j = 1}^{m}{{H_{l\_{uj}}^{(i)}\left( {q_{s}^{(i)},p_{s}^{(i)}} \right)} \cdot u_{sj}^{(i)}}}}$ 4*: |_(t) ₀ means evaluate function value with the values of variables given at time t₀ (I) Construct quenched mean field Hamiltonian for agent i

$\left. {\left. {{H_{MF}^{(i)}\left( {q_{s}^{(i)},p_{MF}^{(i)},u_{s}^{(i)}} \right)} = {H_{{MF}\_{nou}}^{(i)}\left( {q_{s}^{(i)},p_{MF}^{(i)},\left\{ {{q_{{MF}\backslash i}\left( t_{0} \right)},{u_{{MF}\backslash i}\left( t_{0} \right)}} \right\}} \right.}_{quench}} \right) + {\sum\limits_{j = 1}^{m}\;{H_{{MF}\_{uj}}^{(i)}\left( {q_{s}^{(i)},p_{MF}^{(i)},\left\{ {{q_{{MF}\backslash i}\left( t_{0} \right)},{u_{{MF}\backslash i}\left( t_{0} \right)}} \right\}} \right.}_{quench}}} \right) \cdot u_{sj}^{(i)}$ (J) Setup initial condition for

all agents

$\mspace{20mu}{{L_{MF} = {\sum\limits_{k = 1}{L_{l}^{(k)}\left( {{q_{l}^{(k)}(t)},{{\overset{.}{q}}_{l}^{(k)}(t)},{u_{l}^{(k)}(t)}} \right)}}},{{p_{MF}^{(i)}\left( t_{0} \right)} = {\frac{\left. {\partial{L_{MF}\left( {q_{l}^{(i)},{\overset{.}{q}}_{l}^{(i)},u_{l}^{(i)},\left. \left\{ {{q_{{MF}\backslash i}\left( t_{0} \right)},{{\overset{.}{q}}_{{MF}\backslash i} = 0},{u_{{MF}\backslash i}\left( t_{0} \right)}} \right\} \right|_{quench}}\quad \right.}} \right)}{\partial{\overset{.}{q}}_{l}^{(i)}}❘_{t_{0}}}}}$ (K) Construct agent synchronized Hamiltonian and partial derivatives

H_(s)^((i)) = γ^((i)) ⋅ H_(MF)^((i))(q_(s)^((i)), p_(MF)^((i)), u_(s)^((i))) + (1 − γ^((i))) ⋅ H_(l)^((i))(q_(s)^((i)), p_(l)^((i)), u_(s)^((i))) ${\overset{.}{q}}_{s}^{(i)} = {{\gamma^{(i)} \cdot \frac{\partial{H_{MF}^{(i)}\left( {q_{s}^{(i)},p_{MF}^{(i)},u_{s}^{(i)}} \right)}}{\partial p_{MF}^{(i)}}} + {\left( {1 - \gamma^{(i)}} \right) \cdot \frac{\partial{H_{l}^{(i)}\left( {q_{s}^{(i)},p_{l}^{(i)},u_{s}^{(i)}} \right)}}{\partial p_{l}^{(i)}}}}$ ${{\overset{.}{p}}_{MF}^{(i)} = {- \frac{\partial{H_{MF}^{(i)}\left( {q_{s}^{(i)},p_{MF}^{(i)},u_{s}^{(i)}} \right)}}{\partial q_{s}^{(i)}}}},{{\overset{.}{p}}_{l}^{(i)} = {- \frac{\partial{H_{l}^{(i)}\left( {q_{s}^{(i)},p_{l}^{(i)},u_{s}^{(i)}} \right)}}{\partial q_{s}^{(i)}}}}$ with initial conditions: q_(s) ^((i))(t₀), p_(MF) ^((i))(t₀), p_(l) ^((i))(t₀) (L) Set τ←t₀ (M) Numerical Propagation—For the time window [τ, τ+δ_(t) ^((i))], apply numerical integration method (e.g. Runge-Kutta method) to propagate the dynamics of q_(s) ^((i)), p_(MF) ^((i)), p_(l) ^((i)) and u_(s) ^((i)): (M1)—Set t_(start)←τ (M2)—Propagate q_(s) ^((i)), p_(MF) ^((i)), p_(l) ^((i)) over [t_(start), t_(start)+δ_(t)/n_(st)] with constant control vector u_(s) ^((i))(t_(start)):

${{\overset{.}{q}}_{s}^{(i)} = {{\gamma^{(i)} \cdot \frac{\partial{H_{MF}^{(i)}\left( {q_{s}^{(i)},p_{MF}^{(i)},u_{s}^{(i)}} \right)}}{\partial p_{MF}^{(i)}}} + {\left( {1 - \gamma^{(i)}} \right) \cdot \frac{\partial{H_{l}^{(i)}\left( {q_{s}^{(i)},p_{l}^{(i)},u_{s}^{(i)}} \right)}}{\partial p_{l}^{(i)}}}}},{{\overset{.}{p}}_{MF}^{(i)} = {- \frac{\partial{H_{MF}^{(i)}\left( {q_{s}^{(i)},p_{MF}^{(i)},u_{s}^{(i)}} \right)}}{\partial q_{s}^{(i)}}}},{{\overset{.}{p}}_{l}^{(i)} = {- \frac{\partial{H_{l}^{(i)}\left( {q_{s}^{(i)},p_{l}^{(i)},u_{s}^{(i)}} \right)}}{\partial q_{s}^{(i)}}}}$ with initial conditions q_(s) ^((i))(t_(start)), p_(MF) ^((i))(t_(start)), p_(l) ^((i))(t_(start)), record q_(s) ^((i)), p_(MF) ^((i)), p_(l) ^((i)), {dot over (q)}_(s) ^((i)), {dot over (p)}_(MF) ^((i)), {dot over (p)}_(l) ^((i)) at t_(start)+δ_(t)/n_(st) (M3)—Set t_(start)←t_(start)+δ_(t) ^((k))/n_(st) ^((k)) (M4)—t_(start)=τ+δ_(t) ^((i))? If no, return to (M2), and otherwise set t_(start)←τ. (M5)—Propagate u_(sj) ^((i)) over [t_(start), t_(start)+δ_(t)/n_(st)] for j=1, 2, . . . , m simultaneously with q_(s) ^((i)), p_(MF) ^((i)), p_(l) ^((i)), {dot over (q)}_(s) ^((i)), {dot over (p)}_(MF) ^((i)), {dot over (p)}_(l) ^((i)) to be fixed values at t_(start) and with initial conditions u_(sj) (t_(start)), and record u_(sj) ^((i)), {dot over (u)}_(sj) ^((i)), at t_(start)+δ_(t)/n_(st)

${{{{\left. {{{{\left. {{{{{\overset{.}{u}}_{sj}^{(i)} = {{- \Gamma} \cdot \left\lbrack {{\gamma^{(i)} \cdot \left( {{\alpha_{{MF}\_ j}\left( t_{start} \right)} + {\sum\limits_{k = 1}^{m}{{\beta_{{MF}\_{jk}}\left( t_{start} \right)} \cdot \ {u_{sk}^{(i)}(t)}}}} \right)} + {\left( {1 - \gamma^{(i)}} \right)\left( {{\alpha_{l\_ j}\left( t_{start} \right)} + {\sum\limits_{k = 1}^{m}{{\beta_{l\_{jk}}\left( t_{start} \right)}\ .\ {u_{sk}^{(i)}(t)}}}} \right)}} \right\rbrack}}{{{where}\mspace{14mu}{\beta_{{MF}\_{jk}}\left( t_{start} \right)}} = \left( {{H_{{MF}\_{uj}}^{(i)} \cdot \left( {{\frac{\partial H_{{MF}\_{uk}}^{(i)}}{\partial q_{s}^{(i)}} \cdot \ {\overset{.}{q}}_{s}^{(i)}} + {\frac{\partial H_{{MF}\_{uk}}^{(i)}}{\partial p_{MF}^{(i)}} \cdot \ {\overset{.}{p}}_{MF}^{(i)}}} \right)} + {H_{{MF}\_{uk}}^{(i)} \cdot \left( {{\frac{\partial H_{{MF}\_{uj}}^{(i)}}{\partial q_{s}^{(i)}} \cdot {\overset{.}{q}}_{s}^{(i)}} + {\frac{\partial H_{{MF}\_{uj}}^{(i)}}{\partial p_{MF}^{(i)}} \cdot {\overset{.}{p}}_{MF}^{(i)}}} \right)}} \right)}}}_{t\_{start}}{{\alpha_{{MF}\_ j}\left( t_{start} \right)} = {\left( {{H_{{MF}\_{uj}}^{(i)}\left( {{\frac{\partial H_{{MF}\_{nou}}^{(i)}}{\partial q_{s}^{(i)}} \cdot {\overset{.}{q}}_{s}^{(i)}} + {\frac{\partial H_{{MF}\_{nou}}^{(i)}}{\partial p_{MF}^{(i)}} \cdot {\overset{.}{p}}_{MF}^{(i)}}} \right)} + \left( {H_{{MF}\_{nou}}^{(i)} - H_{D}^{(i)}} \right._{t_{0}}} \right)\left( {{\frac{\partial H_{{MF}\_{uj}}^{(i)}}{\partial q_{s}^{(i)}} \cdot {\overset{.}{q}}_{s}^{(i)}} + {\frac{\partial H_{{MF}\_{uj}}^{(i)}}{\partial p_{MF}^{(i)}} \cdot {\overset{.}{p}}_{MF}^{(i)}}} \right)}}} \right)}_{t\_{start}}{{\beta_{l\_{jk}}\left( t_{start} \right)} = \left( {{H_{l\_{uj}}^{(i)} \cdot \left( {{\frac{\partial H_{l\_{uk}}^{(i)}}{\partial q_{s}^{(i)}} \cdot {\overset{.}{q}}_{s}^{(i)}} + {\frac{\partial H_{l\_{uk}}^{(i)}}{\partial p_{l}^{(i)}} \cdot {\overset{.}{p}}_{l}^{(i)}}} \right)} + {H_{l\_{uk}}^{(i)} \cdot \left( {{\frac{\partial H_{l\_{uj}}^{(i)}}{\partial q_{s}^{(i)}} \cdot {\overset{.}{q}}_{s}^{(i)}} + {\frac{\partial H_{l\_{uj}}^{(i)}}{\partial p_{l}^{(i)}} \cdot {\overset{.}{p}}_{l}^{(i)}}} \right)}} \right)}}}_{t\_{start}}{{\alpha_{{l\_}j}\left( t_{start} \right)} = {\left( {{H_{l\_{uj}}^{(i)} \cdot \left( {{\frac{\partial H_{l\_{nou}}^{(i)}}{\partial q_{s}^{(i)}} \cdot {\overset{.}{q}}_{s}^{(i)}} + {\frac{\partial H_{l\_{nou}}^{(i)}}{\partial p_{l}^{(i)}} \cdot {\overset{.}{p}}_{l}^{(i)}}} \right)} + \left( {H_{l\_{nou}}^{(i)} - H_{D}^{(i)}} \right._{t_{0}}} \right)\left( {{\frac{\partial H_{l\_{uj}}^{(i)}}{\partial q_{S}^{(i)}} \cdot {\overset{.}{q}}_{s}^{(i)}} + {\frac{\partial H_{l\_{uj}}^{(i)}}{\partial p_{l}^{(i)}} \cdot {\overset{.}{p}}_{l}^{(i)}}} \right)}}} \right)}_{t\_{start}}\mspace{20mu}{{\left. {\left( {M\; 6} \right) - {{Set}\mspace{14mu} t_{start}}}\leftarrow{t_{start} + {\delta_{t}^{(k)}/{n_{st}^{(k)}\left( {M\; 7} \right)}} - t_{start}} \right. = {\tau + {{\delta_{t}^{(k)}?\mspace{14mu}{If}}\mspace{14mu}{no}}}},{{return}\mspace{14mu}{to}\mspace{14mu}\left( {M\; 5} \right)},{\left. {{and}\mspace{14mu}{otherwise}\mspace{14mu}{update}\mspace{14mu}\tau}\leftarrow{\tau + {\delta_{t}^{(k)}\left( {M\; 8} \right)} - \tau} \right. = {t_{0} + {{\Delta_{T}^{(k)}?\mspace{14mu}{If}}\mspace{14mu}{no}}}},{{proceed}\mspace{14mu}{to}\mspace{14mu}\left( {M\; 9} \right)},{{{{and}\mspace{14mu}{otherwise}\mspace{14mu}{jump}\mspace{14mu}{to}\mspace{14mu}{(N).\left( {M\; 9} \right)}} - {p_{MF}^{(i)}(\tau)}} = \frac{\left. {\partial{L_{MF}\left( {q_{s}^{(i)},{\overset{.}{q}}_{s}^{(i)},u_{s}^{(i)},\left\{ {{q_{{MF} \smallsetminus l_{i}}\left( t_{0} \right)},{{\overset{.}{q}}_{{MF} \smallsetminus l_{i}} = 0},{u_{{MF} \smallsetminus l_{i}}\left( t_{0} \right)}} \right\}} \right.}_{quench}} \right)}{\partial{\overset{.}{q}}_{s}^{(i)}}}}}}_{\tau}\mspace{20mu}{p_{l}^{(i)}(\tau)}} = {\frac{\partial{L_{l}\left( {q_{s}^{(i)},{\overset{.}{q}}_{s}^{(i)},u_{s}^{(i)}} \right)}}{\partial{\overset{.}{q}}_{s}^{(i)}}❘_{\tau}}$ Return to (M). (N) Apply triangle window filter to compute q _(s) ^((i)), p _(l) ^((i)), ū_(s) ^((i)), p _(MF) ^((i)), {dot over (q)}_(s) ^((i)), {dot over (p)}_(l) ^((i)), {dot over (ū)}_(s) ^((i)), {dot over (p)}_(MF) ^((i))

-   -   Compute weights: for k=1, 2, . . . , 2·K,         ω(t ₀ +k·δ _(t))=k/K if k≤K;ω(t ₀ +k·δ _(t))=2−k/K if k>K     -   Compute weighted average:

${{\overset{\_}{q}}_{s}^{(i)} = \frac{\sum\limits_{k = 1}^{2 \cdot K}{{\omega\left( {t_{0} + {k \cdot \delta_{t}}} \right)} \cdot {q_{s}^{(i)}\left( {t_{0} + {k \cdot \delta_{t}}} \right)}}}{\sum\limits_{k = 1}^{2 \cdot K}{\omega\left( {t_{0} + {k \cdot \delta_{t}}} \right)}}},{{\overset{\overset{\_}{.}}{q}}_{s}^{(i)} = \frac{\sum\limits_{k = 1}^{2 \cdot K}{{\omega\left( {t_{0} + {k \cdot \delta_{t}}} \right)} \cdot {{\overset{.}{q}}_{s}^{(i)}\left( {t_{0} + {k \cdot \delta_{t}}} \right)}}}{\sum\limits_{k = 1}^{2 \cdot K}{\omega\left( {t_{0} + {k \cdot \delta_{t}}} \right)}}}$ ${{\overset{\_}{u}}_{s}^{(i)} = \frac{\sum\limits_{k = 1}^{2 \cdot K}{{\omega\left( {t_{0} + {k \cdot \delta_{t}}} \right)} \cdot {u_{s}^{(i)}\left( {t_{0} + {k \cdot \delta_{t}}} \right)}}}{\sum\limits_{k = 1}^{2 \cdot K}{\omega\left( {t_{0} + {k \cdot \delta_{t}}} \right)}}},{{\overset{\overset{\_}{.}}{u}}_{s}^{(i)} = \frac{\sum\limits_{k = 1}^{2 \cdot K}{{\omega\left( {t_{0} + {k \cdot \delta_{t}}} \right)} \cdot {{\overset{.}{u}}_{s}^{(i)}\left( {t_{0} + {k \cdot \delta_{t}}} \right)}}}{\sum\limits_{k = 1}^{2 \cdot K}{\omega\left( {t_{0} + {k \cdot \delta_{t}}} \right)}}}$ ${{\overset{\_}{p}}_{l}^{(i)} = \frac{\sum\limits_{k = 1}^{2 \cdot K}{{\omega\left( {t_{0} + {k \cdot \delta_{t}}} \right)} \cdot {p_{l}^{(i)}\left( {t_{0} + {k \cdot \delta_{t}}} \right)}}}{\sum\limits_{k = 1}^{2 \cdot K}{\omega\left( {t_{0} + {k \cdot \delta_{t}}} \right)}}},{{\overset{\overset{\_}{.}}{p}}_{l}^{(i)} = \frac{\sum\limits_{k = 1}^{2 \cdot K}{{\omega\left( {t_{0} + {k \cdot \delta_{t}}} \right)} \cdot {{\overset{.}{p}}_{l}^{(i)}\left( {t_{0} + {k \cdot \delta_{t}}} \right)}}}{\sum\limits_{k = 1}^{2 \cdot K}{\omega\left( {t_{0} + {k \cdot \delta_{t}}} \right)}}}$ ${{\overset{\_}{p}}_{MF}^{(i)} = \frac{\sum\limits_{k = 1}^{2 \cdot K}{{\omega\left( {t_{0} + {k \cdot \delta_{t}}} \right)} \cdot {p_{MF}^{(i)}\left( {t_{0} + {k \cdot \delta_{t}}} \right)}}}{\sum\limits_{k = 1}^{2 \cdot K}{\omega\left( {t_{0} + {k \cdot \delta_{t}}} \right)}}},{{\overset{\overset{\_}{.}}{p}}_{MF}^{(i)} = \frac{\sum\limits_{k = 1}^{2 \cdot K}{{\omega\left( {t_{0} + {k \cdot \delta_{t}}} \right)} \cdot {{\overset{.}{p}}_{MF}^{(i)}\left( {t_{0} + {k \cdot \delta_{t}}} \right)}}}{\sum\limits_{k = 1}^{2 \cdot K}{\omega\left( {t_{0} + {k \cdot \delta_{t}}} \right)}}}$ (O) Construct synchronized momentum—for k=0, 1, . . . , 2·K: p _(s) ^((i))(t ₀ k·δ _(t))=γ^((i)) ·p _(MF) ^((i))(t ₀ +k·δ _(t))+(1−γ^((i)))p _(l) ^((i))(t ₀ +k·δ _(t)) {dot over (p)} _(s) ^((i))(t ₀ k·δ _(t))=γ^((i)) ·{dot over (p)} _(MF) ^((i))(t ₀ +k·δ _(t))+(1−γ^((i))){dot over (p)} _(l) ^((i))(t ₀ +k·δ _(t)) p _(s) ^((i))=γ^((i)) ·p _(MF) ^((i))+(1=γ^((i)))· p _(l) ^((i)),{dot over ( p )}_(s) ^((i))=γ^((i))·{dot over ( p )}_(MF) ^((i))+(1−γ^((i)))·{dot over ( p )}_(l) ^((i)) (P) Save Results to Blackboard q _(s) ^((i)),{dot over ( q )}_(s) ^((i)) ,p _(s) ^((i)),{dot over ( p )}_(s) ^((i)) ,ū _(s) ^((i)),{dot over (ū)}_(s) ^((i)) ,p _(l) ^((i)),{dot over ( p )}_(l) ^((i)) ,p _(MF) ^((i)),{dot over ( p )}_(MF) ^((i)) q _(s) ^((i))(t ₀ +k·δ _(t)),p _(s) ^((i))(t ₀ +k·δ _(t)),p _(l) ^((i))(t ₀ +k·δ _(t)),u _(s) ^((i))(t ₀ +k·δ _(t)),p _(MF) ^((i))(t ₀ +k·δ _(t)), {dot over (q)} _(s) ^((i))(t ₀ +k·δ _(t)),{dot over (p)} _(s) ^((i))(t ₀ +k·δ _(t)),{dot over (p)} _(l) ^((i))(t ₀ +k·δ _(t)),{dot over (u)} _(s) ^((i))(t ₀ +k·δ _(t)), {dot over (p)} _(MF) ^((i))(t ₀ +k·δ _(t)),u _(s) ^((i))(t ₀ +k·δ _(t)),{dot over (u)} _(s) ^((i))(t ₀ +k·δ _(t)) for k=0,1,2, . . . ,2·K (Q) Return to (C). Note that a way to pick up a next agent for processing depends on the CDI window setting for each agent. The CDI window length of different CDI agents can be different. For example, the CDI window for a battery is much shorter than the CDI window for a building. Suppose the CDI window length for a building is twice of the length of the window for a battery. Then mean field synchronization will execute the building synchronization after battery has been synchronized two times. Also note, with respect to nonlinear Kalman Bucy filtered initial condition for propagator, there are three sequences of a state vector, as shown above—one that is associated with the local model, one that is associated with the synchronized model, and one that is associated with the local model and with the combined control as input. Each sequence may have its own associated nonlinear Kalman Bucy filter applied for adjusting the initial condition for propagator by considering the same measured observation data.

It will be appreciated that the examples of FIGS. 2A-2D are provided for illustrative purposes and are simplified for the sake of brevity, and the inventive techniques may be used in a wide variety of other situations, including in other environments and with other types of automated control action determination techniques, some of which are discussed below. As one non-exclusive example, the control system may be performing an automated analysis of data generated by and/or received by a target system, such as in an attempt to identify anomalies with a sufficiently low degree of uncertainty (e.g., to analyze mammograph images to detect anomalies in comparison to other known-good mammograph images lacking non-normal tissue; such as to identify non-normal tissue; to analyze other types of images for differences from known-good samples; to analyze computer network traffic for differences for example network traffic that lacks problems, such as to determine problems with excess latency, excess bandwidth usage, etc.; to analyze computer system files and/or downloads and/or memory and/or storage for differences from known-good samples, such as to detect malware; etc.)—if so, the control system manager component may modify the control system to reduce differences with an idealized domain having no anomalies and no uncertainty, such as to modify a control system actuator that identifies anomalies and/or assesses uncertainty in such results, that regulates a portion of the target system generating and/or receiving the data being analyzed, etc. As another non-exclusive example, the target system may include a motor and the control system may control when and how the motor is used (e.g., to move an electrical vehicle or other type of powered vehicle, adjust valves or openings in physical systems, etc.)—if so, the control system manager component may modify the control system to reduce differences with an idealized domain having no excess torque or otherwise wasted use of the motor, such as to modify a control system actuator that regulates the output of the motor (e.g., a transmission or gear system), etc. As another non-exclusive example, the target system may include one or more super-capacitor electrical devices and the control system may control when and/or how and/or how much power is supplied to and/or from the super-capacitor(s) (e.g., to supplement batteries in use, such as batteries being used to power trains or subways or automobiles or bicycles or airplanes or drones or other vehicles, by using dynamic braking to store power and by reducing the power load on the batteries at time of vehicle acceleration or other times of high power demand, etc.)—if so, the control system manager component may modify the control system to reduce differences with an idealized domain having no power dissipation and/or no excess use of the batteries beyond a defined threshold, such as to modify a control system actuator that regulates the input to and/or output of the super-capacitor(s). As another non-exclusive example, the control system may be controlling a target system having an electrical device that performs computing functionality (e.g., a computer device or system) and generates data (e.g., network communications, data to be stored, etc.), such as in an attempt to regulate network traffic that is sent (e.g., to prevent problems of one or more defined types, such as with network latency, bandwidth usage, dropped packets, etc.) or to regulate usage of storage space and capabilities (e.g., to prevent storage bottlenecks, excess device usage, etc.)—if so, the control system manager component may modify the control system to reduce differences with an idealized domain having network traffic or other generated data that is within a defined range and/or has no problems of any of one or more defined types, such as to modify a control system actuator that regulates an amount and/or timing of network traffic sent and/or data stored, etc.

FIG. 3 is a block diagram illustrating example computing systems suitable for performing techniques for implementing automated control systems to control or otherwise manipulate at least some operations of specified physical systems or other target systems, including having control state manager components for use in repeatedly and automatically modifying state information for control components (e.g., actuators) of electrical devices used in the target systems, and having one or more control state coordination manager components for use in repeatedly and automatically synchronizing control state improvements from the control state manager components (e.g., to improve the collective control system functionality according to one or more criteria, such as to reduce power dissipation), as discussed in greater detail elsewhere herein.

In particular, FIG. 3 illustrates a server computing system 300 suitable for providing at least some functionality of a CDD system including a control state manager component and control state coordination manager component and other components, various client computer systems 350 that may be used by customers or other users of the CDD system 340, and one or more target systems to be controlled (in this example, target system 1 360 and target system 2 370), which are accessible to the CDD system 340 and its control state manager components 345 and control state coordination manager components 343 over one or more computer networks 390, although in other embodiments the control state manager components, control state coordination manager components and/or other CDD components may execute local to a target system that they are controlling). In other embodiments, multiple computing systems may be used for the execution of a CDD system (e.g., to have one or more computing systems executing the CDD Decision Module Construction component for initial configuration and setup before run-time control occurs, and one or more other computing systems performing run-time control by executing one or more copies of the CDD Control Action Determination component 344 and/or the CDD Coordinated Control Management component 346 and/or the CDD Control State Manager component 345 and/or the CDD Control State Coordination Manager component 343; to have one or more computing systems executing a Control State Manager component and/or Control State Coordination Manager component that are separate from one or more other computing systems executing some or all other components of a CDD system with which the control state manager component and/or control state coordination manager component interact; to have different computing systems executing different Control State Manager components and Control State Coordination Manager components; etc.).

In the illustrated embodiment, the Control State Manager component 345 is executing in memory 330 as part of the CDD system 340, and in some embodiments the component includes various software instructions that when executed program one or more of the hardware CPU processors 305 to provide an embodiment of a control state manager component as described elsewhere herein. Similarly, the Control State Coordination Manager component 343 is executing in memory 330 as part of the CDD system 340 in the illustrated embodiment, and in some embodiments the component includes various software instructions that when executed program one or more of the hardware CPU processors 305 to provide an embodiment of a control state coordination manager component as described elsewhere herein. During operation, in at least some embodiments, the Control State Manager component may obtain various input data (not shown) regarding a target system (e.g., from one or more sensors), and modify one or more target system state models (e.g., models 323 stored on storage 320) that are in use by one or more other CDD system components to control the target system, such as by determining adjustments to control system actuator state information 322 in use by one or more control system actuators regulating batteries or other elements of the target system, as well as exchange various information with other executing components, as discussed in greater detail elsewhere herein. In addition, in at least some embodiments, the Control State Coordination Manager component may, during operation, synchronize control system actuator system information 322 in use by one or more control system actuators regulating batteries or other elements of the target system, such as to improve operation of the control domain of the overall target system over time, as discussed in greater detail elsewhere herein.

The server computing system 300 has components in the illustrated embodiment that include one or more hardware CPU (“central processing unit”) computer processors 305, various I/O (“input/output”) hardware components 310, storage 320, and memory 330. The illustrated I/O components include a display 311, a network connection 312, a computer-readable media drive 313, and other I/O devices 315 (e.g., a keyboard, a mouse, speakers, etc.). In addition, the illustrated client computer systems 350 may each have components similar to those of server computing system 300, including one or more hardware CPUs 351, I/O components 352, storage 354, and memory 357, although some details are not illustrated for the computing systems 350 for the sake of brevity. The target systems 360 and 370 may also each include one or more computing systems (not shown) having components that are similar to some or all of the components illustrated with respect to server computing system 300, including to optionally locally execute one or more CDD components, but such computing systems and components are also not illustrated in this example for the sake of brevity.

The CDD system 340 is executing in memory 330 and includes components 342-346, and in some embodiments the system and/or components each includes various software instructions that when executed program one or more of the CPU processors 305 to provide an embodiment of a CDD system as described elsewhere herein. The CDD system 340 may interact with computing systems 350 over the network 390 (e.g., via the Internet and/or the World Wide Web, via a private cellular network, etc.), as well as the target systems 360 and 370 in this example. In this example embodiment, the CDD system includes functionality related to generating and deploying decision modules in configured manners for customers or other users, as discussed in greater detail elsewhere herein, as well as generating or deploying control state manager components 345 and control state coordination manager components 343 at runtime to improve functionality of an operating control system. The other computing systems 350 may also be executing various software as part of interactions with the CDD system 340 and/or its components. For example, client computing systems 350 may be executing software in memory 357 to interact with CDD system 340 (e.g., as part of a Web browser, a specialized client-side application program, etc.), such as to interact with one or more interfaces (not shown) of the CDD system 340 to configure and deploy automated control systems (e.g., stored automated control systems 325 that were previously created by the CDD system 340 for use in controlling one or more physical target systems) or other decision modules 329, as well as to perform various other types of actions, as discussed in greater detail elsewhere. Various information related to the functionality of the CDD system 340 may be stored in storage 320, such as information 321 related to users of the CDD system (e.g., account information), and information 323 related to one or more target systems (e.g., systems that have batteries to be controlled), including models that have been generated of particular target systems (e.g., target systems 1 and 2) and are optionally in use by an associated CDD control system.

It will be appreciated that computing systems 300 and 350 and target systems 360 and 370 are merely illustrative and are not intended to limit the scope of the present invention. The computing systems may instead each include multiple interacting computing systems or devices, and the computing systems/nodes may be connected to other devices that are not illustrated, including through one or more networks such as the Internet, via the Web, or via private networks (e.g., mobile communication networks, etc.). More generally, a computing node or other computing system or device may comprise any combination of hardware that may interact and perform the described types of functionality, including without limitation desktop or other computers, database servers, network storage devices and other network devices, PDAs, cell phones, wireless phones, pagers, electronic organizers, Internet appliances, television-based systems (e.g., using set-top boxes and/or personal/digital video recorders), and various other consumer products that include appropriate communication capabilities. In addition, the functionality provided by the illustrated CDD system 340 and its components may in some embodiments be distributed in additional components. Similarly, in some embodiments some of the functionality of the CDD system 340 and/or CDD components 342-346 may not be provided and/or other additional functionality may be available.

As part of implementing an automated control system for a particular target system, an embodiment of a Collaborative Distributed Decision (CDD) system may use the described techniques to perform various automated activities involved in constructing and implementing the automated control system, including generating one or more CDI agents (also referred to as a CDD decision module or system, or a portion of such module or system) for use as some or all of an automated control system in controlling particular target systems.

In particular, the CDD system may in some embodiments implement a Decision Module Construction component that interacts with one or more users to obtain a description of a target system, including restrictions related to the various elements of the target system, and one or more goals to be achieved during control of the target system the Decision Module Construction component then performs various automated actions to generate, test and deploy one or more executable decision modules (also referred to at times as “decision elements” and/or “agents”) to use in performing the control of the target system. The Decision Module Construction component may thus operate as part of a configuration or setup phase that occurs before a later run-time phase in which the generated decision modules are executed to perform control of the target system, although in some embodiments and situations the Decision Module Construction component may be further used after an initial deployment to improve or extend or otherwise modify an automated control system that has one or more decision modules (e.g., while the automated control system continues to be used to control the target system), such as to implement functionality of a control state manager component to improve and update a model of a target system being controlled, or to add, remove or modify decision modules for the automated control system.

When the one or more executable decision modules are deployed and executed, the CDD system may further provide various components within or external to the decision modules being executed to manage their control of the target system, such as a Control Action Determination component of each decision module as part of a control system to optimize or otherwise enhance the control actions that the decision module generates, a Control State Manager component to improve functionality of the control system as it is controlling a target system, and/or one or more Coordinated Control Management components to coordinate the control actions of multiple decision modules that are collectively performing the control of the target system.

As noted above, a Collaborative Distributed Decision (CDD) system may in some embodiments use at least some of the described techniques to perform various automated activities involved in constructing and implementing an automated control system for a specified target system, such as to modify or otherwise manipulate inputs or other control elements of the target system that affect its operation (e.g., affect one or more outputs of the target system). An automated control system for such a target system may in some situations have a distributed architecture that provides cooperative distributed control of the target system, such as with multiple decision modules that each control a portion of the target system and that operate in a partially decoupled manner with respect to each other. If so, the various decision modules' operations for the automated control system may be at least partially synchronized, such as by each reaching a consensus with one or more other decision modules at one or more times, even if a fully synchronized convergence of all decision modules at all times is not guaranteed or achieved.

In some embodiments, some or all automated control systems that are generated and deployed may further provide various components within them for execution during the runtime operation of the automated control system, such as by including such components within decision modules in some embodiments and situations. Such components may include, for example, a Control Action Determination component of each decision module (or of some decision modules) to optimize or otherwise determine and improve the control actions that the decision module generates, and/or a Control State Manager component of each decision module (or of some decision modules) to improve functionality of the control system while it is controlling a target system. For example, such a Control Action Determination component in a decision module may in some embodiments attempt to automatically determine the decision module's control actions for a particular time to reflect a near-optimal solution with respect to or one more goals and in light of a model of the decision module for the target system that has multiple inter-related constraints and based on current state information that is modeled for the target system if so, such a near-optimal solution may be based at least in part on a partially optimized solution that is within a threshold amount of a fully optimized solution. Such determination of one or more control actions to perform may occur for a particular time and for each of one or more decision modules, as well as be repeated over multiple times for ongoing control by at least some decision modules in some situations. In some embodiments, the model for a decision module is implemented as a Hamiltonian function that reflects a set of coupled differential equations based in part on constraints representing at least part of the target system, such as to allow the model and its Hamiltonian function implementation to be updated over multiple time periods by adding additional expressions within the evolving Hamiltonian function, as discussed in greater detail elsewhere herein.

In some embodiments, the components included within a generated and deployed automated control system for execution during the automated control system's runtime operation may further include one or more Coordinated Control Management components to coordinate the control actions of multiple decision modules that are collectively performing the control of a target system for the automated control system. For example, some or all decision modules may each include such a Coordinated Control Management component in some embodiments to attempt to synchronize that decision module's local solutions and proposed control actions with those of one or more other decision modules in the automated control system, such as by determining a consensus shared model with those other decision modules that simultaneously provides solutions from the decision module's local model and the models of the one or more other decision modules. Such inter-module synchronizations may occur repeatedly to determine one or more control actions for each decision module at a particular time, as well as to be repeated over multiple times for ongoing control. In addition, each decision module's model is implemented in some embodiments as a Hamiltonian function that reflects a set of coupled differential equations based in part on constraints representing at least part of the target system, such as to allow each decision module's model and its Hamiltonian function implementation to be combined with the models of one or more other decision modules by adding additional expressions for those other decision modules' models within the initial Hamiltonian function for the local model of the decision module, as discussed in greater detail elsewhere herein.

It will also be appreciated that, while various items are illustrated as being stored in memory or on storage while being used, these items or portions of them may be transferred between memory and other storage devices for purposes of memory management and data integrity. Alternatively, in other embodiments some or all of the software components and/or systems may execute in memory on another device and communicate with the illustrated computing systems via inter-computer communication. Thus, in some embodiments, some or all of the described techniques may be performed by hardware means that include one or more processors and/or memory and/or storage when configured by one or more software programs (e.g., by the Control State Manager components 345 and/or by the Control State Coordination Manager components 343 and/or other of the CDD components 342-346, or more generally by the CDD system 340) and/or data structures, such as by execution of software instructions of the one or more software programs and/or by storage of such software instructions and/or data structures. Furthermore, in some embodiments, some or all of the systems and/or components may be implemented or provided in other manners, such as by using means that are implemented at least partially or completely in firmware and/or hardware, including, but not limited to, one or more application-specific integrated circuits (ASICs), standard integrated circuits, controllers (e.g., by executing appropriate instructions, and including microcontrollers and/or embedded controllers), field-programmable gate arrays (FPGAs), complex programmable logic devices (CPLDs), etc. Some or all of the components, systems and data structures may also be stored (e.g., as software instructions or structured data) on a non-transitory computer-readable storage medium, such as a hard disk or flash drive or other non-volatile storage device, volatile or non-volatile memory (e.g., RAM), a network storage device, or a portable media article to be read by an appropriate drive (e.g., a DVD disk, a CD disk, an optical disk, etc.) or via an appropriate connection. The systems, components and data structures may also in some embodiments be transmitted as generated data signals (e.g., as part of a carrier wave or other analog or digital propagated signal) on a variety of computer-readable transmission mediums, including wireless-based and wired/cable-based mediums, and may take a variety of forms (e.g., as part of a single or multiplexed analog signal, or as multiple discrete digital packets or frames). Such computer program products may also take other forms in other embodiments. Accordingly, the present invention may be practiced with other computer system configurations.

FIG. 4 is a flow diagram of an example embodiment of a Collaborative Distributed Decision (CDD) system routine 400. The routine may, for example, be provided by execution of the CDD system 340 of FIG. 3 and/or the CDD system 140 of FIG. 1B, such as to provide functionality to construct and implement automated control systems for specified target systems.

The illustrated embodiment of the routine begins at block 410, where information or instructions are received. If it is determined in block 420 that the information or instructions of block 410 include an indication to create or revise one or more decision modules for use as part of an automated control system for a particular target system, the routine continues to block 425 to initiate execution of a Decision Module Construction component, and in block 430 obtains and stores one or more resulting decision modules for the target system that are created in block 425. One example of a routine for such a Decision Module Construction component is discussed in greater detail with respect to FIGS. 5A-5B.

After block 430, or if it is instead determined in block 420 that the information or instructions received in block 410 are not to create or revise one or more decision modules, the routine continues to block 440 to determine whether the information or instructions received in block 410 indicate to deploy one or more created decision modules to control a specified target system, such as for one or more decision modules that are some or all of an automated control system for that target system. The one or more decision modules to deploy may have been created immediately prior with respect to block 425, such that the deployment occurs in a manner that is substantially simultaneous with the creation, or in other situations may include one or more decision modules that were created at a previous time and stored for later use. If it is determined to deploy one or more such decision modules for such a target system, the routine continues to block 450 to initiate the execution of those one or more decision modules for that target system, such as on one or more computing systems local to an environment of the target system, or instead on one or more remote computing systems that communicate with the target system over one or more intermediary computer networks (e.g., one or more computing systems under control of a provider of the CDD system). The execution of some or all such decision modules may further include executing an associated control state manager component to improve functionality of the decision modules and their control system during operation by adjusting state information for one or more control system actuators (with FIGS. 9A-9B providing an example of a routine for execution of a control state manager component), and may additionally include executing an associated control state coordination manager component to improve functionality of the decision modules and their control system during operation by synchronizing control state information improvements for multiple control system actuators from respective control state manager components (with FIGS. 10A-10B providing an example of a routine for execution of a control state coordination manager component).

After block 450, the routine continues to block 460 to determine whether to perform a coordinated management of multiple decision modules being deployed in a manner external to those decision modules, such as via one or more centralized Coordinated Control Management components and/or centralized Control State Coordination Manager components (e.g., if the decision modules do not have local copies of the component(s)). If so, the routine continues to block 465 to initiate execution of one or more such centralized CDD Coordinated Control Management components and/or centralized CDD Control State Coordination Manager components for use with those decision modules. After block 465, or if it is instead determined in block 460 to not perform such coordination management in an external manner (e.g., if only one decision module is executed, if multiple decision modules are executed but coordinate their operations in a distributed peer-to-peer manner via local CDD Coordinated Control Management components and/or local CDD Control State Coordination Manager components, etc.), the routine continues to block 470 to optionally obtain and store information about the operations of the one or more decision modules and/or resulting activities that occur in the target system, such as for later analysis and/or reporting.

If it is instead determined in block 440 that the information or instructions received in block 410 are not to deploy one or more decision modules, the routine continues instead to block 485 to perform one or more other indicated operations if appropriate. For example, such other authorized operations may include obtaining results information about the operation of a target system in other manners (e.g., by monitoring outputs or other state information for the target system), analyzing results of operations of decision modules and/or activities of corresponding target systems, generating reports or otherwise providing information to users regarding such operations and/or activities, etc. In addition, in some embodiments the analysis of activities of a particular target system over time may allow patterns to be identified in operation of the target system, such as to allow a model of that target system to be modified accordingly (whether manually or in an automated learning manner) to reflect those patterns and to respond based on them. In addition, as discussed in greater detail elsewhere, distributed operation of multiple decision modules for an automated control system in a partially decoupled manner allows various changes to be made while the automated control system is in operation, such as to add one or more new decision modules, to remove one or more existing decision modules, to modify the operation of a particular decision module (e.g., by changing rules or other information describing the target system that is part of a model for the decision module), etc. In addition, the partially decoupled nature of multiple such decision modules in an automated control system allows one or more such decision modules to operate individually at times, such as if network communication issues or other problems prevent communication between multiple decision modules that would otherwise allow their individualized control actions to be coordinated in such situations, some or all such decision modules may continue to operate in an individualized manner, such as to provide useful ongoing control operations for a target system even if optimal or near-optimal solutions cannot be identified from coordination and synchronization between a group of multiple decision modules that collectively provide the automated control system for the target system.

After blocks 470 or 485, the routine continues to block 495 to determine whether to continue, such as until an explicit indication to terminate is received. If it is determined to continue, the routine returns to block 410, and otherwise continues to block 499 and ends.

FIGS. 5A-5B illustrate a flow diagram of an example embodiment of a CDD Decision Module Construction routine 500. The routine may, for example, be provided by execution of the component 342 of FIG. 3 and/or the component 142 of FIG. 1B, such as to provide functionality to allow users to provide information describing a target system of interest, and to perform corresponding automated operations to construct one or more decision modules to use to control the target system in specified manners. While the illustrated embodiment of the routine interacts with users in particular manners, such as via a displayed GUI (graphical user interface), it will be appreciated that other embodiments of the routine may interact with users in other manners, such as via a defined API (application programming interface) that an executing program invokes on behalf of a user. In some embodiments, the routine may further be implemented as part of an integrated development environment or other software tool that is available for one or more users to use, such as by implementing an online interface that is available to a variety of remote users over a public network such as the Internet, while in other embodiments a copy of the CDD system and/or particular CDD components may be used to support a single organization or other group of one or more users, such as by being executed on computing systems under the control of the organization or group. In addition, the CDD Decision Module Construction component may in some embodiments and situations be separated into multiple sub-components, such as a rules editor component that users interact with to specify rules and other description information for a target system, and a rules compiler engine that processes the user-specified rules and other information to create one or more corresponding decision modules.

The illustrated embodiment of the routine 500 begins at block 510, where the routine provides or updates a displayed user interface to one or more users, such as via a request received at an online version of component that is implementing the routine, or instead based on the routine being executed by one or more such users on computing systems that they control. While various operations are shown in the illustrated embodiment of the routine as occurring in a serial manner for the purpose of illustration, it will be appreciated that user interactions with such a user interface may occur in an iterative manner and/or over multiple periods of time and/or user sessions, including to update a user interface previously displayed to a user in various manners (e.g., to reflect a user action, to reflect user feedback generated by operation of the routine or from another component, etc.), as discussed further below.

After block 510, the routine continues to block 520 to receive information from one or more such users describing a target system to be controlled, including information about a plurality of elements of the target system that include one or more manipulatable control elements and optionally one or more outputs that the control elements affect, information about rules that specify restrictions involving the elements, information about state information that will be available during controlling of the system (e.g., values of particular elements or other state variables, such as from passive sensors), and one or more goals to achieve during the controlling of the target system. It will be appreciated that such information may be obtained over a period of time from one or more users, including in some embodiments for a first group of one or more users to supply some information related to a target system and for one or more other second groups of users to independently provide other information about the target system, such as to reflect different areas of expertise of the different users and/or different parts of the target system.

After block 520, the routine continues to block 525 to identify any errors that have been received in the user input, and to prompt the user(s) to correct those errors, such as by updating the display in a corresponding manner as discussed with respect to block 510. While the identification of such errors is illustrated as occurring after the receiving of the information in block 520, it will be appreciated that some or all such errors may instead be identified as the users are inputting information into the user interface, such as to identify syntax errors in rules or other information that the users specify. After block 525, the illustrated embodiment of the routine continues to block 530 to optionally decompose the information about the target system into multiple subsets that each correspond to a portion of the target system, such as with each subset having one or more different control elements that are manipulatable by the automated control system being created by the routine, and optionally have overlapping or completely distinct goals and/or sets of rules and other information describing the respective portions of the target system. As discussed in greater detail elsewhere, such decomposition, if performed, may in some situations be performed manually by the users indicating different subgroups of information that they enter, and/or in an automated manner by the routine based on an analysis of the information that has been specified (e.g., based on the size of rules and other descriptive information supplied for a target system, based on inter-relationships between different rules or goals or other information, etc.). In other embodiments, no such decomposition may be performed.

After block 530, the routine continues to block 535 to, for each subset of target system description information (or for all the received information if no such subsets are identified), convert that subset (or all the information) into a set of constraints that encapsulate the restrictions, goals, and other specified information for that subset (or for all the information). In block 540, the routine then identifies any errors that occur from the converting process, and if any are identified, may prompt the user to correct those errors, such as in a manner similar to that described with respect to blocks 525 and 510. While not illustrated in this example, the routine may in some situations in blocks 525 and/or 540 return to block 510 when such errors are identified, to display corresponding feedback to the user(s) and to allow the user(s) to make corrections and re-perform following operations such as those of blocks 520-540. Errors identified in the converting process in block 540 may include, for example, errors related to inconsistent restrictions, such as if the restrictions as a group are impossible to satisfy.

After block 540, the routine continues to block 542 to generate one or more control state manager components to use at run-time with the automated control system being generated, such as one for each subset determined in block 530, one for the entire automated control system, etc. In particular, the generation of the one or more control state manager components is performed in a manner similar to that discussed with respect to FIGS. 2A-2D and elsewhere herein, including to obtain and use particular types of state, momentum and control information during runtime operations, to analyze the information to determine improvements to make to control functionality of the control system, and to implement such determined improvements in one or more control system actuators that regulate portions of the target system. Additional details related to such a control state manager component are included elsewhere herein.

After block 542, the routine continues to block 545 to, for each set of constraints (or a single constraint set if no subsets were identified in block 530), apply one or more validation rules to the set of constraints to test overall effectiveness of the corresponding information that the constraints represent, and to prompt the one or more users to correct any errors that are identified in a manner similar to that with respect to blocks 525, 540 and 510. Such validation rules may test one or more of controllability, observability, stability, and goal completeness, as well as any user-added validation rules, as discussed in greater detail elsewhere. In block 550, the routine then converts each validated set of constraints to a set of coupled differential equations that model at least a portion of the target system to which the underlying information corresponds.

After block 550, the routine continues to block 553 to perform activities related to training a model for each set of coupled differential equations, including to determine one or more of a size of a training time window to use, size of multiple training time slices within the time window, and/or a type of training time slice within the time window. In some embodiments and situations, the determination of one or more such sizes or types of information is performed by using default or pre-specified information, while in other embodiments and situations the users may specify such information, or an automated determination of such information may be performed in one or more manners (e.g., by testing different sizes and evaluating results to find sizes with the best performance). Different types of time slices may include, for example, successions of time slices that overlap or do not overlap, such that the training for a second time slice may be dependent only on results of a first time slice (if they do not overlap) or instead may be based at least in part on updating information already determined for at least some of the first time slice (if they do overlap in part or in whole). After block 553, the routine continues to block 555 to, for each set of coupled differential equations representing a model, train the model for that set of coupled differential equations using partial initial state information determined externally for the target system (e.g., from passive sensors), including to estimate values of variable that are not known and/or directly observable for the target system by simulating effects of performing control actions over the time window, such as for successive time slices throughout the time window, and to test the simulated performance of the trained model.

After block 555, the routine continues to block 560 to determine whether the training and testing was successful, and if not returns to block 510 to display corresponding feedback information to the users to allow them to correct errors that caused the lack of success. If it is instead determined in block 560 that the testing and training were successful, however, the routine continues instead to block 585 to generate an executable decision module for each trained and tested model that includes that model, as well as a local CDD Control Action Determination component that the decision module will use when executed to determine optimal or near-optimal control actions to perform for the target system based on the information included in the model and in light of the one or more goals for that decision module, and that includes or uses at least one CDD Control State Manager component generated in block 542. The generated executable decision module may in some embodiments and situations further include a local CDD Coordinated Control Management component to coordinate control actions of multiple decision modules that collectively will provide an automated control system for the target system (such as by synchronizing respective models of the various decision modules over time), and/or further include a local CDD Control State Coordination Manager component to coordinate control state actuator state information improvements for multiple such decision modules that collectively provide an automated control system for the target system (such as by synchronizing models of control system actuator(s)′ state or other control system actuator state information of the various decision modules over time). After block 585, the routine continues to block 590 to provide the generated executable decision modules for use, including to optionally store them for later execution and/or deployment.

After block 590, the routine continues to block 595 to determine whether to continue, such as until an explicit indication to terminate is received. If it is determined to continue, the routine returns to block 510, and otherwise continues to block 599 and ends.

FIGS. 6A-6B illustrate a flow diagram of an example embodiment of a routine 600 corresponding to a generic representation of a decision module that is being executed. The routine may, for example, be provided by execution of a decision module 329 or as part of an automated control system 325 of FIG. 3, the automated control system 195 a of FIG. 1A, the automated control system 205 a of FIGS. 2A-2D, and/or a decision module 124 or 128 of FIG. 1B or 1C, such as to provide functionality for controlling at least a portion of a target system in a manner specific to information and a model encoded for the decision module, including to reflect one or more goals to be achieved by the decision module during its controlling activities. As discussed in greater detail elsewhere, in some embodiments and situations, multiple decision modules may collectively and cooperatively act to control a particular target system, such as with each decision module controlling one or more distinct control elements for the target system or otherwise representing or interacting with a portion of the target system, while in other embodiments and situations a single decision module may act alone to control a target system. The routine 600 further reflects actions performed by a particular example decision module when it is deployed in controlling a portion of a target system, although execution of at least portions of a decision module may occur at other times, such as initially to train a model for the decision module before the decision module is deployed, as discussed in greater detail with respect to the CDD Decision Module Construction routine 500 of FIGS. 5A-5B.

The illustrated embodiment of the routine 600 begins at block 610, where an initial model for the decision module is determined that describes at least a portion of a target system to be controlled, one or more goals for the decision module to attempt to achieve related to control of the target system, and optionally initial state information for the target system. The routine continues to block 615 to perform one or more actions to train the initial model if needed, as discussed in greater detail with respect to blocks 553 and 555 of FIGS. 5A-5B—in some embodiments and situations, such training for block 615 is performed only if initial training is not done by the routine 500 of FIGS. 5A-5B, while in other embodiments and situations the training of block 615 is performed to capture information about a current state of the target system at a time that the decision module begins to execute (e.g., if not immediately deployed after initial creation and training) and/or to re-train the model at times as discussed in greater detail with respect to routine 700 of FIGS. 7A-7B as initiated by block 630.

After block 615, the routine continues to block 617 to initiate execution of a control state manager component that performs a control state improvement feedback loop concurrently with other control loop actions performed by the illustrated routine, including to improve control functionality of the decision module and its control system during operation of the routine 600 by determining improvements to state information of one or more control system actuators that regulate operations of portions of the target system and performing corresponding modifications. One example of execution of such a control state manager component is illustrated in FIGS. 9A-9B.

After block 617, the routine continues to block 619 to determine a time period to use for performing each control action decision for the decision module, such as to reflect a rate at which control element modifications in the target system are needed and/or to reflect a rate at which new incoming state information is received that may alter future manipulations of the control elements. The routine then continues to block 620 to start the next time period, beginning with a first time period moving forward from the startup of the execution of the decision module. Blocks 620-680 are then performed in a control loop for each such time period going forward until execution of the decision module is suspended or terminated, although in other embodiments a particular decision module may execute for only a single time period each time that it is executed.

In block 625, the routine optionally obtains state information for the time period, such as current state information that has been received from the target system (e.g., via one or more passive sensors) or one or more related external sources since the last time period began, and/or by actively retrieving current values of one or more elements of the target system or corresponding variables as needed. In block 630, the routine then initiates execution of a local CDD Control Action Determination component of the decision module, with one example of such a routine discussed in greater detail with respect to routine 700 of FIGS. 7A-7B. In block 635, the results of the execution of the component in block 630 are received, including to either obtain an updated model for the decision module with a local solution for the current time period and decision module that includes one or more proposed control action determinations that the decision module may perform for the current time period, or to receive an indication that no local solution was found for the decision module in the allowed time for the execution of the component in block 630. It is then determined in block 640 whether a solution was found, and if so continues to block 642 to store the updated model for the decision module, and otherwise continues to block 643 to use the prior model for the decision module to determine one or more control action determinations that are proposed for the current time period based on a previous model (e.g., that does not reflect recent changes in state information and/or recent changes in activities of other decision modules, if any), as discussed in greater detail with respect to routine 700 of FIGS. 7A-7B.

After blocks 642 or 643, the routine continues to block 644 to determine if other decision modules are collectively controlling portions of the current target system, such as part of the same automated control system as the local decision module, and if so continues to block 645. Otherwise, the routine selects the local proposed control actions of the decision module as a final determined control action to perform, and continues to block 678 to implement those control actions for the current time period.

If there are other operating decision modules, the routine in block 645 determines if the local decision module includes a local copy of a CDD Coordinated Control Management (CCM) component for use in synchronizing the proposed control action determinations for the decision module's local solutions with activities of other decision modules that are collectively controlling the same target system. If so, the routine continues to block 647 to provide the one or more proposed control action determinations of the decision module and the corresponding current local model for the decision module to the local CDD CCM component, and otherwise continues to block 649 to provide the one or more proposed control action determinations for the decision module and the corresponding local model of the decision module to one or more centralized CDD CCM components.

After blocks 647 or 649, the routine continues to block 650 to obtain results of the actions of the CDD CCM component(s) in blocks 647 or 649, including to either obtain a further updated model resulting from synchronization of the local model for the current decision module with information from one or more other decision modules, such that the further updated model indicates one or more final control action determinations to perform for the time period for the current decision module, or an indication that no such synchronization was completed in the allowed time. The routine continues to block 652 to determine whether the synchronization was completed, and if so continues to block 654 to store the further updated model from the synchronization, and otherwise continues to block 656 to use the prior proposed control action determinations locally to the decision module as the final control action determinations for the time period.

After blocks 654 or 656, the routine continues to block 678 to implement the one or more final determined control actions for the decision module in the target system, such as by interacting with one or more effectuators or other actuators in the target system that regulate one or more control elements of the target system (e.g., modify input and/or output values of, or otherwise manipulate them), or by otherwise providing input to the target system to cause such modifications or other manipulations to occur. In block 680, the routine optionally obtains information about the results in the target system of the control actions performed, and stores and/or provides information to the CDD system about such obtained results and/or about the activities of the decision module for the current time period. After block 680, the routine continues to block 682 to determine whether to do a possible structural model adaptation update based on learned soft rules (if any), such as periodically, based on whether or not a solution was found with respect to block 640, based on whether or not synchronization was done with respect to block 652, etc. If so, the routine continues to block 684 to initiate operations of the CDD Decision Module Construction component with respect to the control state manager component in blocks 563-583, such as to return with an updated version of the model and/or a corresponding decision module.

After block 684, or if it was determined in block 682 to not do a possible structural model adaptation update based on learned soft rules, the routine continues to block 695 to determine whether to continue, such as until an indication to terminate or suspend is received (e.g., to reflect an end to current operation of the target system or an end of use of the decision module to control at least a portion of the target system). If it is determined to continue, the routine returns to block 620 to start the next time period, and otherwise continues to block 699 and ends.

FIGS. 7A-7B are a flow diagram of an example embodiment of a CDD Control Action Determination routine 700. The routine may, for example, be provided by execution of component 344 of FIG. 3 and/or components 144 a-n or 184 of FIG. 1C, such as to determine control actions for a decision module to propose and/or implement for a target system during a particular time period, including in some embodiments to perform an optimization to determine near-optimal actions (e.g., within a threshold of an optimal solution) to perform with respect to one or more goals if possible. While the illustrated embodiment of the routine is performed in a manner local to a particular decision module, such that some or all decision modules may each implement a local version of such a routine, in other embodiments the routine may be implemented in a centralized manner by one or more components with which one or more decision modules interact over one or more networks, such as with a particular decision module indicated to be used at a particular time rather than acting on behalf of the local decision module.

The illustrated embodiment of the routine 700 begins at block 703, where information or a request is received. The routine continues to block 705 to determine a type of the information or request, and to proceed accordingly. In particular, if a request is received in block 703 to attempt to determine a solution for a current time period given a current model of the local decision module, the routine continues to block 710 to begin to perform such activities, as discussed in greater detail with respect to block 710-790. If it is instead determined in block 705 that a request to relax one or more rules or other restrictions for the current model of the local decision module is received, such as discussed in greater detail with respect to blocks 760 and 765, the routine continues to block 765. If it is determined in block 705 that a request is received to repair one or more rules or other restrictions for the current model of the local decision module, such as discussed in greater detail with respect to blocks 775 and 780, the routine continues to block 780 to obtain user input to use during the rule repair process (e.g., to interact with a CDD Decision Module Construction component, or to instead interact with one or more users in another manner), such as to allow the current model for the local decision module to later be updated and replaced based on further resulting user actions, or if operation of the target system can be suspended, to optionally wait to further perform the routine 700 until such an updated model is received.

If it is instead determined in block 705 that the information or request is of another type, the routine continues instead to block 708 to perform one or more other indicated operations as appropriate, and to then proceed to block 799. Such other indicated operations may include, for example, receiving information about current models and/or control actions proposed or performed by one or more other decision modules that are collectively controlling a target system with the local decision module (such as for use in synchronizing the model of the local decision module with such other decision modules by generating a consensus or converged shared model, as discussed in greater detail with respect to routine 800 of FIGS. 8A-8B), to receive updates to a model or underlying information for the model for use in ongoing operation of the routine 700 (e.g., from a CDD Decision Module Construction component, such as results from interactions performed in block 780; etc.), to receive current state information for the target system, such as for use as discussed in routine 600 of FIGS. 6A-6B, etc.

If it determined in block 705 that a request for a solution was received in block 703 for a current time period and based on a current model of the local decision module, the routine continues to block 710 to receive a current set of coupled differential equations that represent the current model for the local decision module of at least a portion of the target system, optionally along with additional state information for the target system for the current time. The routine then continues to block 715 to determine whether to train or re-train the model, such as if the routine is called for a first time upon initial execution of a corresponding decision module or if error measurements from ongoing operations indicate a need for re-training, as discussed in greater detail with respect to blocks 755, 770 and 730. If it is determined to train or re-train the model, the routine continues to block 720 to determine one or more of the size of a training time window, size of training time slices within the time window, and/or type of training time slices within the training time window, such as in a manner similar to that previously discussed with respect to block 553 of routine 500 of FIGS. 5A-5B. After block 720, the routine continues to block 725 to use partial initial state information for the target system to train the model, including to estimate values of state variables for the target system that are not known and/or directly observable, by simulating effects of performing control actions over the time window for each of the time slices, as discussed in greater detail with respect to block 555 of routine 500 of FIGS. 5A-5B.

After block 725, or if it is instead determined in block 715 not to train or re-train the model, the routine continues to block 730 to perform a piecewise linear analysis to attempt to determine a solution for the current model and any additional state information that was obtained in block 710, with the solution (if determined) including one or more proposed control action determinations for the local decision module to take for a current time period, as well as in some embodiments to use one or more model error gauges to make one or more error measurements with respect to the current model, as discussed in greater detail elsewhere. The routine then continues to block 735 to determine if the operations in block 730 determined a solution within an amount of time allowed for the operation of block 730 (e.g., a defined subset or fraction of the current time period), and if so continues to block 740 to update the current set of coupled differential equations and the resulting current model for the local decision module to reflect the solution, with the resulting updated information provided as an output of the routine 700.

If it is instead determined in block 735 that the operations in block 730 did not determine a solution, the routine continues to block 745 to determine if additional time is available within the current time period for further attempts to determine a solution, and if not continues to block 790 to provide output of the routine 700 indicating that no solution was determined for the current time period.

If additional time is available within the current time period, however, the routine continues to perform blocks 755-780 to perform one or more further attempts to identify the solution—it will be appreciated that one or more of the operations of blocks 755-780 may be repeatedly performed multiple times for a given time period if sufficient time is available to continue further solution determination attempts. In particular, the routine continues to block 755 if additional time is determined to be available in block 745, where it determines whether the measurements from one or more gauges indicate model error measurements that are over one or more thresholds indicating modifications to the model are needed, such as based on the model error measurements from the gauges discussed with respect to block 730. If not, the routine continues to block 760 to determine whether there are one or more rules or other restrictions in the current model that are available to be relaxed for the current time period (that are not absolute rules and have not previously attempted to be relaxed during the time period, if this is not the first pass through this portion of the routing for the current time period), and if so continues to block 765 to relax one or more such rules or other restrictions and to return to block 730 to re-attempt the piecewise linear analysis with the revised model based on those relaxed rules or other restrictions.

If it is instead determined in block 755 that the model error measurements from one or more of the gauges are sufficient to satisfy one or more corresponding thresholds, the routine continues instead to block 770 to determine whether to re-train the model based on one or more of the gauges indicating sufficient errors to do so, such as based on accumulated errors over one or more time periods of updates to the model. If so, the routine returns to block 720 to perform such re-training in blocks 720 and 725, and then continues to block 730 to re-attempt the piecewise linear analysis with the resulting re-trained model.

If it is instead determined in block 770 not to re-train the model (or if the model was re-trained already for the current time period and the resulting re-attempt in block 730 again failed to find a solution), the routine continues to block 775 to determine whether the model error measurements from one or more of the gauges indicate a subset of one or more rules or other restrictions in the model that potentially have errors that need to be repaired. If so, the routine continues to block 780 to provide information to one or more users via the CDD Decision Module Construction component, to allow the users to revise the rules or other restrictions as appropriate, although in other embodiments some or all such rule repair activities may instead be attempted or performed in an automated manner. After block 780, or if it is instead determined in block 775 not to repair any rules, the routine continues to block 790 to provide an indication that no solution was determined for the current time period. After blocks 740, 708, or 790, the routine continues to block 799 and ends. It will be appreciated that if the routine 700 was instead implemented as a centralized routine that supports one or more decision modules remote from the executing component for the routine, the routine 700 may instead return to block 703 to await further information or requests.

FIGS. 8A-8B are a flow diagram of an example embodiment of a CDD Coordinated Control Management routine 800. The routine may, for example, be provided by execution of the component 346 of FIG. 3 and/or the components 146 a-n of FIG. 1C, such as to attempt to synchronize current models and their proposed control actions between multiple decision modules that are collectively controlling a target system. In the illustrated embodiment of the routine, the synchronization is performed in a pairwise manner between a particular local decision module's local current model and an intermediate shared model for that decision module that is based on information about the current state of one or more other decision modules, by using a Pareto game technique to determine a Pareto equilibrium if possible that is represented in a consensus shared model, although in other embodiments other types of synchronization methods may be used. In addition, in the illustrated embodiment, the routine 800 is performed in a local manner for a particular local decision module, such as by being included within that local decision module, although in other embodiments the routine 800 may be implemented in a centralized manner to support one or more decision modules that are remote from a computing system implementing the component for the routine and that communicate with those decision modules over one or more computer networks, such as with a particular decision module indicated to be used at a particular time rather than acting on behalf of the local decision module.

The illustrated embodiment of the routine 800 begins at block 805, where it waits to receive information or another indication. The routine continues to block 810 to determine if a consensus model or other updated information for another decision module has been received, such as from a copy of the routine 800 executing for that other decision module, and if so continues to block 815 to use the received information to update local intermediate shared model information for use with the local decision module on whose behalf the current copy of the routine 800 is executing, as discussed in greater detail with respect to block 830. If it is instead determined in block 810 that the information or request received in block 805 is not information related to one or more other decision modules, or after block 815, the routine continues to block 820 to determine whether to currently perform a synchronization for the current local model of the local decision module by using information about an intermediate shared model of the local decision module that includes information for one or more other decision modules, such as to do such synchronization each time that an update to the local decision module's model is received (e.g., based on operation of the routine 700 for a copy of the CDD Control Action Determination component local to that decision module) in block 805 and/or each time that information to update the local decision module's intermediate shared model is received in block 805 and used in block 815, or instead as explicitly indicated in block 805—if the synchronization is to currently be performed, the routine continues to block 825 and begins to perform blocks 820-880 related to such synchronization activities. Otherwise, the routine continues to block 885 to perform one or more other indicated operations as appropriate, such as to receive requests from the CDD system or other requestor for current information about operation of the routine 800 and/or to provide corresponding information to one or more entities (e.g., to reflect prior requests), etc.

If it is determined in block 820 that synchronization is to be currently performed, such as based on updated model-related information that is received in block 805, the routine continues to block 825 to obtain a current local model for the local decision module to use in the synchronizing, with the model including one or more proposed control actions to perform for a current time period based on a local solution for the local decision module. The routine then continues to block 830 to retrieve information for an intermediate shared model of the local decision module that represents information for one or more other decision modules (e.g., all other decision modules) that are collectively participating in controlling the target system, with that intermediate shared model similarly representing one or more other proposed control actions resulting from local solutions of those one or more other decision modules, optionally after partial or complete synchronization has been performed for those one or more other decision modules between themselves.

The routine then continues to block 835 to attempt to determine a consensus shared model that synchronizes the current model of the local decision module and the intermediate shared model by simultaneously providing solutions to both the local decision module's current model and the intermediate shared model. In some embodiments, the operations of block 835 are performed in a manner similar to that discussed with respect to blocks 710-730 of routine 700 of FIG. 7A-7B, such as if the local model and the intermediate shared model are combined to create a combination model for whom one or more solutions are to be identified. As discussed in greater detail elsewhere, in some embodiments, the local current model and intermediate shared model may each be represented by a Hamiltonian function to enable a straightforward creation of such a combined model in an additive manner for the respective Hamiltonian functions, with the operations of routines 600 and/or 700 of FIGS. 6A-6B and 7A-7B, respectively, similarly representing the models that they update and otherwise manipulate using such Hamiltonian functions.

After block 835, the routine continues to block 840 to determine whether the operations of block 835 succeeded in an allowed amount of time, such as a fraction or other portion of the current time period for which the synchronization is attempted to be performed, and if so the routine continues to block 845 to update both the local model and the intermediate shared model of the local decision module to reflect the consensus shared model. As earlier noted, if sufficient time is allowed for each decision module to repeatedly determine a consensus shared model with changing intermediate shared models representing one or more other decision modules of a collective group, the decision modules of the collective group may eventually converge on a single converged shared model, although in other embodiments and situations there may not be sufficient time for such convergence to occur, or other issues may prevent such convergence. After block 845, the routine continues to block 850 to optionally notify other decision modules of the consensus shared model determined for the local decision module (and/or of a converged shared model, if the operations of block 835 were a last step in creating such a converged shared model), such as if each of the notified decision modules is implementing its own local version of the routine 800 and the provided information will be used as part of an intermediate shared model of those other decision modules that includes information from the current local decision module's newly constructed consensus shared model.

If it is instead determined in block 840 that a synchronization did not occur in the allowed time, the routine continues to perform blocks 860-875 to re-attempt the synchronization with one or more modifications, sometimes repeatedly if sufficient time is available, and in a manner similar to that discussed with respect to blocks 745-780 of routine 700 of FIGS. 7A-7B. In the illustrated example, the routine determines in block 860 if additional time is available for one or more such re-attempts at synchronization, and if not the routine continues to block 880 to provide an indication that no synchronization was performed within the allowed time. Otherwise, the routine continues to block 870 to take one or more actions to perform one or more of relaxing rules or other restrictions, repairing rules or other restrictions, and/or re-training a model, with respect to one or both of the current model of the local decision module and/or one or more other decision modules whose information is represented in the intermediate shared model of the local decision module. If it is determined in block 870 to proceed in this manner, the routine continues to block 875 to perform corresponding actions, sometimes one at a time in a manner similar to that discussed with respect to routine 700, including to cause resulting updates to the current model of the local decision module and/or to the local intermediate shared model of the local decision module, after which the routine returns to block 835 to re-attempt to synchronize the local model and the intermediate shared model of the local decision module.

If it is instead determined in block 870 that no further actions are to be performed with respect to relaxation, repair and/or re-training, the routine continues instead to block 880. After blocks 850, 880 or 885, the routine continues to block 895 to determine whether to continue, such as until an explicit indication to terminate or suspend operation of the routine 800 is received, such as to reflect an end to operation of the target system and/or an end to use of the local decision module and/or a collective group of multiple decision modules to control the target system. If it is determined to continue, the routine returns to block 805, and otherwise continues to block 899 and ends.

FIGS. 9A-9B are a flow diagram of an example embodiment of a CDD Control State Manager routine 900. The routine may, for example, be provided by execution of the component 195 c of FIG. 1A, component 205 c discussed with respect to FIGS. 2A-2D, component 345 of FIG. 3 and/or as otherwise discussed herein, such as to implement a control state improvement feedback loop with respect to a target system to improve control functionality of a control system for the target system (e.g., for a target system with one or more batteries or other electrical units, to reduce power dissipation). In the illustrated embodiment, the routine 900 is performed in a local manner for a particular local decision module, such as by being included within that local decision module, although in other embodiments the routine 900 may be implemented in a centralized manner to support one or more decision modules that are remote from a computing system implementing the component for the routine and that communicate with those decision modules over one or more computer networks, such as with a particular decision module indicated to be used at a particular time rather than acting on behalf of the local decision module. In addition, while the illustrated embodiment of the routine 900 may determine and implement updates to a control system's functionality (e.g., to control state actuators) concurrently with a control loop that is implementing control actions for the target system controlled by the control system, in some embodiments such updates may be performed at only certain times, such as to coordinate the updates performed by the routine 900 with other activities implemented as part of the control loop being implemented (e.g., with respect to block 678 of routine 600).

The illustrated embodiment of the routine 900 begins at block 905, where information is retrieved and determined for use in propagating state, momentum and control values for a target system being controlled toward an idealized domain of control action response trajectories. In particular, the routine in block 905 determines the idealized domain, and obtains or otherwise determines a time window size for propagation and a number of sampling points for the time window.

The routine then continues to perform a loop from block 910 to 985 for each time window to determine and implement improvements to control functionality of the control system, with the current time when the loop begins corresponding to the beginning of the time window, and with blocks 910-940 performed at or near the beginning of the time window. In block 910, the routine estimates current state and momentum of the target system and its response trajectories to control actions, and obtains or otherwise determines a current control action. In block 920, the ideal momentum is determined for the current time, and values for the current state, momentum and control actions are propagated at the current time over the future time corresponding to the time window. The routine in block 930 then determines, at the current time, the propagated values for each sample point in the time window, and stores the information for later use. In block 940, the routine then computes weighed average values for the state, momentum and control from the sample propagated values, such as by using a triangle window filter.

When time has passed until the midpoint of the time window is reached, the computed weighted average values are used in block 950 to perform corresponding modifications to one or more control state actuators, and those computed weighted average values are selected in block 955 to be used in the next time window loop as its current state, momentum and control actions.

After block 955, the routine continues to block 960 to determine if other decision modules are collectively controlling portions of the current target system, such as part of the same automated control system as the local decision module, and if so continues to block 962. Otherwise, the routine uses the values selected in block 955 as final values to implement for control state information improvements, and continues to block 982 to implement those control actions for the current time period.

If there are other operating decision modules, the routine in block 962 determines if the local decision module includes a local copy of a CDD Control State Coordination Manager (CSCM) component for use in synchronizing the proposed control state information improvements for the decision module's local solutions with corresponding proposed control state information improvements of other decision modules that are collectively controlling the same target system. If so, the routine continues to block 964 to provide the current state, momentum and control action values of the decision module and the corresponding current local model for the decision module to the local CDD CSCM component, and otherwise continues to block 966 to provide the current state, momentum and control action values for the decision module and the corresponding local model of the decision module to one or more centralized CDD CSCM components.

After blocks 964 or 966, the routine continues to block 968 to obtain results of the actions of the CDD CSCM component(s) in blocks 964 or 966, including to either obtain further updated values for the current state, momentum and control actions resulting from synchronization of the local model for the current decision module with information from one or more other decision modules, such that the further updated values are final values to use for control state information improvements for the time period for the current decision module, or an indication that no such synchronization was completed in the allowed time. The routine continues to block 975 to determine whether the synchronization was completed, and if so continues to block 978 to store the further updated values from the synchronization, and otherwise continues to block 980 to use the prior proposed values locally to the decision module as the final values to use for control state information improvements for the time period.

After blocks 978 or 980, or it was instead determined in block 960 that there were not other decision modules to synchronize with, the routine continues to block 982 to implement modifications to improve the control state information for the decision module in the target system based on the final values for the current state, momentum and control actions, such as by interacting with one or more effectuators or other actuators in the target system that regulate one or more control elements of the target system (e.g., modify input and/or output values of, or otherwise manipulate them), or by otherwise providing input to the target system to cause such modifications or other manipulations to occur. In block 982, the routine may further optionally obtain information about the results in the target system of the improvement actions performed, and stores and/or provides information to the CDD system about such obtained results and/or about the activities of the decision module for the current time period.

After block 982, the routine continues to block 985, where it is determined whether to perform a next time window, such as until the corresponding decision module (or control system) ceases operations or another explicit indication to terminate is received. If the next time window is to be performed, the routine returns to block 910 and begins processing for the next time window when the current time reaches the beginning of the next time window, and otherwise continues to block 990 to optionally perform any other operations as appropriate (e.g., determine whether the idealized domain has changed, such as based on analysis of information about the target system's operations from its sensors or other feedback, or instead based on a notification from the associated decision module or control system or from a human operator; store any information about propagated values, computed average values, corresponding modifications to control system actuators, etc. for later use; etc.).

After block 990, the routine continues to block 995 where the routine determines whether to continue with new information about an idealized domain (e.g., if changes to the target system cause the idealized domain to change; to perform processing for another decision module or target system with a different idealized domain; etc.). If it is determined to continue, the routine returns to block 905, and otherwise (e.g., if an explicit indication to terminate is received) continues to block 999 and ends.

FIGS. 10A-10B are a flow diagram of an example embodiment of a CDD Control State Coordination Manager routine 1000. The routine may, for example, be provided by execution of the component 188 of FIG. 1A and as discussed with respect to FIGS. 2A-2D, components 185 of FIG. 1C, component 343 of FIG. 3 and/or as otherwise discussed herein, such as to, with respect to an associated control state manager component's operations for repeatedly and automatically modifying control system state information as part of controlling an electrical device of a target system, synchronizing those operations over time with those of one or more other control state manager components that are participating in controlling other electrical devices of the target system and thus improve their collective control functionality (e.g., to synchronize the control state manager components' operations over time to reduce power dissipation while performing other activities to use associated electrical devices). In the illustrated embodiment, the routine 1000 is performed in a local manner for an associated control state coordination manager component of a particular local decision module, such as by being included within that local decision module, although in other embodiments the routine 1000 may be implemented in a centralized manner to support one or more decision modules (and their control state manager components) that are remote from a computing system implementing the component for the routine and that communicate with those decision modules over one or more computer networks, such as with a particular decision module indicated to be used at a particular time rather than acting on behalf of the local decision module.

The illustrated embodiment of the routine 1000 begins at block 1005, where it waits to receive information or another indication. The routine continues to block 1010 to determine if consensus control state improvement information (or other corresponding updated information) for another decision module has been received, such as from a copy of the routine 1000 executing for that other decision module, and if so continues to block 1015 to use the received information to update local intermediate shared control state improvement information for use with the local decision module on whose behalf the current copy of the routine 1000 is executing, as discussed in greater detail with respect to block 1030.

If it is instead determined in block 1010 that the information or request received in block 1005 is not information related to one or more other decision modules, or after block 1015, the routine continues to block 1020 to determine whether to currently perform a synchronization for a current local control state information improvement of the local decision module by using information about intermediate shared control state improvement information of the local decision module that includes information for one or more other decision modules, such as to do such synchronization each time that an updated improvement to the local decision module's control state information is received (e.g., based on operation of the routine 900 for a copy of the CDD Control State Manager component local to that decision module) in block 1005 and/or each time that improvement information to update the local decision module's intermediate shared control state information is received in block 1005 and used in block 1015, or instead as explicitly indicated in block 1005—if the synchronization is to currently be performed, the routine continues to block 1025 and begins to perform blocks 1020-1080 related to such synchronization activities. Otherwise, the routine continues to block 1085 to perform one or more other indicated operations as appropriate, such as to receive requests from the CDD system or other requestor for current information about operation of the routine 1000 and/or to provide corresponding information to one or more entities (e.g., to reflect prior requests), etc.

If it is determined in block 1020 that synchronization is to be currently performed, such as based on updated control state information improvement-related information that is received in block 1005, the routine continues to block 1025 to obtain current local control state improvement information for the local decision module to use in the synchronizing, with the control state improvement information including one or more proposed values for current state, momentum and control actions for a current time period based on a local solution for the local decision module. The routine then continues to block 1030 to retrieve information for intermediate shared control state improvement information of the local decision module that represents information for one or more other decision modules (e.g., all other decision modules) that are collectively participating in controlling the target system, with that intermediate shared control state improvement information similarly representing one or more other proposed values for current state, momentum and control actions resulting from local solutions of those one or more other decision modules, optionally after partial or complete synchronization has been performed for those one or more other decision modules between themselves.

The routine then continues to block 1035 to attempt to determine consensus shared control state improvements that synchronize the current control state improvement information of the local decision module and the intermediate shared control state improvement information by simultaneously providing solutions to both the local decision module's current control state information improvement and the intermediate shared control state information improvement. In some embodiments, the operations of block 1035 are performed in a manner similar to that discussed with respect to blocks 710-730 of routine 700 of FIG. 7A-7B, such as if the local control state improvement information and the intermediate shared control state improvement information are combined to create a combination control state improvement information for whom one or more solutions are to be identified, with control actions held constant and non-shared momentum and state values quenched as discussed elsewhere herein. As discussed in greater detail elsewhere, in some embodiments, the local current control state information improvement and intermediate shared control state information improvement may each be represented by a data Hamiltonian model or function to enable a straightforward creation of such combined control state improvement information in an additive manner for the respective Hamiltonian models/functions.

After block 1035, the routine continues to block 1040 to determine whether the operations of block 1035 succeeded in an allowed amount of time, such as some or all of the current time period for which the synchronization is attempted to be performed, and if so the routine continues to block 1045 to update both the local control state improvement information and the intermediate shared control state improvement information of the local decision module to reflect the consensus shared control state information improvement. As earlier noted, if sufficient time is allowed for each decision module to repeatedly determine consensus shared control state improvement information with changing intermediate shared control state information improvements representing one or more other decision modules of a collective group, the decision modules of the collective group may eventually converge on a single converged shared control state information improvement, although in other embodiments and situations there may not be sufficient time for such convergence to occur, or other issues may prevent such convergence. After block 1045, the routine continues to block 1050 to optionally notify other decision modules of the consensus shared control state information improvement determined for the local decision module (and/or of a converged shared control state information improvement, if the operations of block 1035 were a last step in creating such a converged shared control state information improvement), such as if each of the notified decision modules is implementing its own local version of the routine 1000 and the provided information will be used as part of an intermediate shared control state information improvement of those other decision modules that includes information from the current local decision module's newly constructed consensus shared control state information improvement.

If it is instead determined in block 1040 that a synchronization did not occur in the allowed time, the routine continues instead to block 1080 to provide an indication of no synchronization. After blocks 1050, 1080 or 1085, the routine continues to block 1095 to determine whether to continue, such as until an explicit indication to terminate or suspend operation of the routine 1000 is received, such as to reflect an end to operation of the target system and/or an end to use of the local decision module and/or a collective group of multiple decision modules to control the target system. If it is determined to continue, the routine returns to block 1005, and otherwise continues to block 1099 and ends.

FIG. 11 illustrates a flow diagram of an example embodiment of a routine 1100 performed for a representative generic target system, with respect to interactions between the target system and one or more decision modules that are controlling at least a portion of the target system. The routine may, for example, be provided by execution of a target system 360 and/or 370 of FIG. 3, an electrical device 195 b of FIG. 1A, a battery 205 b discussed with respect to FIGS. 2A-2D, and/or a target system 160 and/or 170 of FIGS. 1B and 1C, such as to implement operations specific to the target system. It will be appreciated that the illustrated embodiment of the routine focuses on interactions of the target system with the one or more decision modules, and that many or all such target systems will perform many other operations in a manner specific to those target systems that are not illustrated here for the purpose of brevity.

The routine begins at block 1110, where it optionally provides initial state information for the target system to a CDD system for use in an automated control system of the CDD system for the target system, such as in response to a request from the CDD system or its automated control system for the target system, or instead based on configuration specific to the target system (e.g., to be performed upon startup of the target system). After block 1110, the routine continues to block 1120 to receive one or more inputs from a collective group of one or more decision modules that implement the automated control system for the target system, including one or more modified values for or other manipulations of one or more control elements of a plurality of elements of the target system that are performed by one or more such decision modules of the automated control system. As discussed in greater detail elsewhere, the blocks 1120, 1130, 1140 may be repeatedly performed for each of multiple time periods, which may vary greatly in time depending on the target system (e.g., a microsecond, a millisecond, a hundredth of a second, a tenth of a second, a second, 2 seconds, 5 seconds, 10 seconds, 15 seconds, 30 seconds, a minute, 5 minutes, 10 minutes, 15 minutes, 30 minutes, an hour, etc.).

After block 1120, the routine continues to block 1130 to perform one or more actions in the target system based on the inputs received, including to optionally produce one or more resulting outputs or other results within the target system based on the manipulations of the control elements. In block 1140, the routine then optionally provides information about the outputs or other results within the target system and/or provides other current state information for the target system to the automated control system of the CDD system and/or to particular decision modules of the automated control system, such as to be obtained and measured or otherwise analyzed via passive sensors and/or active sensors. The routine then continues to block 1195 to determine whether to continue, such as until an explicit indication to terminate or suspend operation of the target system is received. If it is determined to continue, the routine returns to block 1120 to begin a next set of control actions for a next time period, and otherwise continues to block 1199 and ends. As discussed in greater detail elsewhere, state information that is provided to a particular decision module may include requests from external systems to the target system, which the automated control system and its decision modules may determine how to respond to in one or more manners. In addition, while the control state manager component in the illustrated embodiment makes modifications directly to control system actuators within the target system (rather than providing modification information to the target system for it to use to attempt to make such modifications, in a manner analogous to blocks 1120 and 1130), in other embodiments the routine 1100 may receive and act on such control system actuator modification requests.

It will be appreciated that the functionality provided by the routines discussed above may be provided in alternative ways in some embodiments, such as being split among more routines or consolidated into fewer routines. Similarly, illustrated routines may in some embodiments provide more or less functionality than is described, such as when other illustrated routines instead lack or include such functionality respectively, or when the amount of functionality provided is altered. Also, while various operations may be illustrated as being performed in a particular manner (e.g., in serial or parallel, synchronously or asynchronously, etc.) and/or in a particular order, those skilled in the art will appreciate that the operations may be performed in other orders and in other manners. Those skilled in the art will also appreciate that the data structures discussed above may be structured in different manners, such as by having a single data structure split into multiple data structures or by having multiple data structures consolidated into a single data structure. Similarly, in some embodiments illustrated data structures may store more or less information than is described, such as when other illustrated data structures instead lack or include such information respectively, or when the amount or types of information that is stored is altered.

From the foregoing it will be appreciated that, although specific embodiments have been described for purposes of illustration, modifications may be made without deviating from the spirit and scope of the invention. Accordingly, the invention is not limited except as by the appended claims and the elements recited therein. In addition, while certain aspects of the invention are presented below in certain claim forms, the inventors contemplate the various aspects of the invention in any available claim form (e.g., while some aspects of the invention may not be recited as being embodied in a computer-readable medium or as part of a system, other aspects may likewise be so embodied), and with any combination of claim elements in different claims that are not logically inconsistent. 

What is claimed is:
 1. A computer-implemented method comprising: obtaining, by one or more computing systems of a collaborative distributed decision system, and for each of multiple decision modules that collectively control a physical system having a plurality of electrical devices and that individually are each associated with one or more electrical devices of the plurality and associated with one or more control elements that alter operations of the one or more electrical devices, proposed modifications to state information used by the associated one or more control elements that are determined by the decision module to reduce power dissipation by the associated one or more electrical devices based on resulting changes in operations of the associated one or more control elements, including: modifying, by one of the multiple decision modules that is implemented on the one or more computing systems and is controlling ongoing operations of one or more electrical devices of the plurality of electrical devices, attributes of one or more actuators for the one or more electrical devices to reduce power dissipation, by: obtaining the state information from multiple sensors that measure characteristics of the plurality of electrical devices; determining differences between a current level of power dissipation from operations of the plurality of electrical devices and an ideal level of power dissipation; and identifying, based at least in part on the obtained state information, one or more changes in an amount of resistance of the one or more actuators that reduce the determined differences; and providing the identified one or more changes as the proposed modifications to state information for the one decision module; generating, by the one or more computing systems, and for each of the multiple decision modules via a determined Pareto equilibrium, a consensus shared set of modifications for the decision module that synchronizes the proposed modifications determined by the decision module with an intermediate shared set of modifications representing additional proposed state information modifications determined by one or more other of the multiple decision modules, wherein the consensus shared set of modifications for the decision module has one or more identified modifications to the state information used by the one or more control elements associated with the decision module that simultaneously reduce power dissipation by the one or more electrical devices associated with the decision module and reduce power dissipation for at least one other electrical device controlled by the one or more other decision modules; and initiating, by the one or more computing systems, and for each of the multiple decision modules, performance of the one or more identified modifications to the state information for the one or more control elements associated with the decision module that are included in the consensus shared set of modifications for the decision module, to cause power dissipation improvements during further control of the physical system.
 2. The computer-implemented method of claim 1 wherein the obtaining of the proposed modifications to state information for the one decision modules further includes: receiving, by the one or more computing systems, a model representing the physical system and based at least in part on binary rules that use operating principles of the physical system and that evaluate state information for the plurality of electrical devices to determine how to use the plurality of electrical devices; and controlling, by a control system of the one decision module that is implemented on the one or more computing systems, the ongoing operations by using the model and the obtained state information to determine control actions that involve using the plurality of electrical devices, and performing the determined control actions to use the plurality of electrical devices.
 3. The computer-implemented method of claim 2 wherein the model includes a total Hamiltonian function that is based on the binary rules and on historical data from previous operations of the physical system, wherein the binary rules include one or more absolute rules that specify non-modifiable restrictions that are requirements regarding the ongoing operations of the physical system, and further include one or more hard rules that specify restrictions regarding the ongoing operations of the physical system that can be modified in specified situations, and wherein the total Hamiltonian function is further based in part on one or more soft rules that each specifies one or more additional conditions to be evaluated to reach one of multiple possible values other than true or false with an associated likelihood.
 4. The computer-implemented method of claim 1 wherein the determining of the differences between the current level of power dissipation and the ideal level of power dissipation includes: estimating, by the one or more computing systems, a current state and a current momentum of the physical system; determining, by the one or more computing systems, an ideal state and an ideal momentum for the physical system; propagating, by the one or more computing systems and over a defined time window, state and momentum and control values to reduce differences from the current state and the current momentum and a current control to the determined ideal state and the determined ideal momentum and a determined ideal control; sampling, by the one or more computing systems, the propagated state and momentum and control values at each of a defined quantity of sampling points within the defined time window; and computing, by the one or more computing systems, weighted average values for state and momentum and control from the sampled propagated state and momentum and control values, wherein the computed weighted average values are used as the determined differences.
 5. The computer-implemented method of claim 4 wherein the determining of the differences between the current level of power dissipation and the ideal level of power dissipation includes determining a current domain of possible responses of the physical system to control actions at a current time, and wherein the propagating of the state and momentum and control values includes propagating the determined current domain toward an ideal domain of possible responses of the physical system to control actions.
 6. The computer-implemented method of claim 1 wherein the proposed modifications to state information of each decision module is modeled as a data Hamiltonian function, and wherein the generating of the consensus shared set of modifications of each decision module includes generating a consensus data Hamiltonian function based at least in part on combining the data Hamiltonian functions for multiple decision modules.
 7. The computer-implemented method of claim 1 further comprising controlling ongoing operations of the physical system by, for each of a plurality of times, using a control loop for each of the multiple decision modules to determine control actions to perform and to perform the determined control actions, and using a separate control state improvement feedback loop for each of the multiple decision modules to determine the proposed modifications to the state information for the decision module, to repeatedly reduce the power dissipation.
 8. The computer-implemented method of claim 1 wherein the obtaining of the proposed modifications and the generating of the consensus shared set of modifications and the initiating of the performance of the one or more identified modifications are performed for a first time, and wherein the method further comprises, for each of multiple additional times after the first time and for one of the multiple decision modules, adapting the consensus shared set of modifications of the one decision module for the additional time by: updating, by the one or more computing systems and for the additional time, the intermediate shared set of modifications used in the generating of the consensus shared set of modifications for the one decision module based at least in part on updates to the consensus shared set of modifications for at least one of the one or other decision modules whose additional proposed state information modifications are represented by that intermediate shared set of modifications; updating, by the one or more computing systems and for the additional time, the proposed modifications to state information of the one decision module based at least in part on additional sensor information that identifies state information at the additional time for the one or more control elements associated with the one decision module; determining, by the one or more computing systems and for the additional time, if an updated consensus shared set of modifications for the one decision module can be generated by attempting to determine an additional Pareto equilibrium between the updated proposed modifications of the one decision module for the additional time and the updated intermediate shared set of modifications for the additional time, wherein the updated consensus shared set of modifications, if generated, has one or more additional identified modifications to the state information used by the one or more control elements associated with the one decision module that simultaneously reduce combined power dissipation by the one or more electrical devices associated with the one decision module and at least one other electrical device controlled by the one or more other decision modules; and if the updated consensus shared set of modifications for the additional time is generated, performing the one or more additional identified modifications to the state information for the additional time for the one or more control elements associated with the one decision module that are included in the updated consensus shared set of modifications for the one decision module.
 9. The computer-implemented method of claim 8 further comprising, for each of the multiple additional times and if the updated consensus shared set of modifications for that additional time is not generated, performing the updated proposed modifications of the one decision module for the additional time to the state information for the one or more control elements associated with the one decision module.
 10. The computer-implemented method of claim 9 wherein generating of the updated consensus shared set of modifications for the one decision module for one of the multiple additional times includes a deadline for the generating to enable real-time control of the physical system to be performed based on performing actions in the physical system for the one additional time, and wherein the generating of the updated consensus shared set of modifications for the one additional time fails to complete before the deadline, such that the one or more actions performed in the physical system for that one additional time include performance of the updated proposed modifications of the one decision module for the additional time to the state information for the one or more control elements associated with the one decision module.
 11. The computer-implemented method of claim 1 further comprising generating a converged shared set of modifications that is based on the consensus shared set of modifications for the multiple decision modules and that simultaneously reduces collective power dissipation of the plurality of electrical devices, wherein the generating of the converged shared set of modifications includes successively synchronizing state information modification pairs that each includes at least one consensus shared set of modifications to converge on the converged shared set of modifications, and wherein the converged shared set of modifications includes the one or more identified modifications to the state information of the consensus shared set of modifications for at least some of the multiple decision modules.
 12. The computer-implemented method of claim 1 wherein the physical system includes an electrical vehicle and the plurality of electrical devices include one or more batteries, and wherein the method further comprises supplying electricity from the one or more batteries to a motor that moves the electrical vehicle, the supplying being based at least in part on a model representing the physical system and having binary rules that use operating principles of the physical system and that evaluate state information for the plurality of electrical devices to determine how to use the plurality of electrical devices and further having at least one specified goal that includes maximizing life of the one or more batteries while supplying energy to and/or from the one or more batteries according to indicated criteria.
 13. The computer-implemented method of claim 1 wherein the plurality of electrical devices include one or more batteries, wherein the physical system includes an electricity generating facility that stores generated electricity in the one or more batteries, and wherein the method further comprises supplying electricity to the one or more batteries at one or more time, the supplying being based at least in part on a model representing the physical system and having binary rules that use operating principles of the physical system and that evaluate state information for the plurality of electrical devices to determine how to use the plurality of electrical devices and further having at least one specified goal that includes maximizing life of the one or more batteries.
 14. The computer-implemented method of claim 1 wherein the plurality of electrical devices include one or more super capacitor elements that store and/or supply electricity and one or more batteries, and wherein the method further comprises supplying electricity to and/or from the one or more super capacitor elements at one or more times, the supplying being based at least in part on a model representing the physical system and having binary rules that use operating principles of the physical system and that evaluate state information for the plurality of electrical devices to determine how to use the plurality of electrical devices and further having at least one specified goal that includes maximizing life of the one or more batteries.
 15. A non-transitory computer-readable medium having stored contents that cause one or more computing systems of a collaborative distributed decision system to perform automated operations including at least: obtaining, by the one or more computing systems of the collaborative distributed decision system, and for each of multiple decision modules that collectively control a physical system having a plurality of electrical devices and that individually are each associated with one or more electrical devices of the plurality and associated with one or more control elements that alter operations of the one or more electrical devices, proposed modifications to state information used by the associated one or more control elements that are determined by the decision module to reduce power dissipation by the associated one or more electrical devices based on resulting changes in operations of the associated one or more control elements, including: modifying, by one of the multiple decision modules that is implemented on the one or more computing systems and is controlling ongoing operations of one or more electrical devices of the plurality of electrical devices, attributes of one or more actuators for the one or more electrical devices to reduce power dissipation, by: obtaining the state information from multiple sensors that measure characteristics of the plurality of electrical devices; determining differences between a current level of power dissipation from operations of the plurality of electrical devices and an ideal level of power dissipation; and identifying, based at least in part on the obtained state information, one or more changes in an amount of resistance of the one or more actuators that reduce the determined differences; and providing the identified one or more changes as the proposed modifications to state information for the one decision module; generating, by the one or more computing systems, and for each of the multiple decision modules via a determined Pareto equilibrium, a consensus shared set of modifications for the decision module that synchronizes the proposed modifications determined by the decision module with an intermediate shared set of modifications representing additional proposed state information modifications determined by one or more other of the multiple decision modules, wherein the consensus shared set of modifications for the decision module has one or more identified modifications to the state information used by the one or more control elements associated with the decision module that simultaneously reduce power dissipation by the one or more electrical devices associated with the decision module and reduce power dissipation for at least one other electrical device controlled by the one or more other decision modules; and initiating, by the one or more computing systems, and for each of the multiple decision modules, performance of the one or more identified modifications to the state information for the one or more control elements associated with the decision module that are included in the consensus shared set of modifications for the decision module, to cause power dissipation improvements during further control of the physical system.
 16. A system comprising: one or more hardware processors of one or more computing systems; and one or more memories with stored instructions that, when executed by at least one of the one or more hardware processors, cause the one or more computing systems to perform automated operations of a collaborative distributed decision system, including: obtaining, for each of multiple decision modules that collectively control a physical system having a plurality of electrical devices and that individually are each associated with one or more electrical devices of the plurality and associated with one or more control elements that alter operations of the one or more electrical devices, proposed modifications to state information used by the associated one or more control elements that are determined by the decision module to reduce power dissipation by the associated one or more electrical devices based on resulting changes in operations of the associated one or more control elements, including: modifying, by one of the multiple decision modules that is implemented on the one or more computing systems and is controlling ongoing operations of one or more electrical devices of the plurality of electrical devices, attributes of one or more actuators for the one or more electrical devices to reduce power dissipation, by: obtaining the state information from multiple sensors that measure characteristics of the plurality of electrical devices; determining differences between a current level of power dissipation from operations of the plurality of electrical devices and an ideal level of power dissipation; and identifying, based at least in part on the obtained state information, one or more changes in an amount of resistance of the one or more actuators that reduce the determined differences; and providing the identified one or more changes as the proposed modifications to state information for the one decision module; generating, for each of the multiple decision modules via a determined Pareto equilibrium, a consensus shared set of modifications for the decision module that synchronizes the proposed modifications determined by the decision module with an intermediate shared set of modifications representing additional proposed state information modifications determined by one or more other of the multiple decision modules, wherein the consensus shared set of modifications for the decision module has one or more identified modifications to the state information used by the one or more control elements associated with the decision module that simultaneously reduce power dissipation by the one or more electrical devices associated with the decision module and reduce power dissipation for atleast one other electrical device controlled by the one or more other decision modules; and initiating, for each of the multiple decision modules, performance of the one or more identified modifications to the state information for the one or more control elements associated with the decision module that are included in the consensus shared set of modifications for the decision module, to cause power dissipation improvements during further control of the physical system. 